Orthogonal Partitions in Designed Experiments

R. A. Bailey ()
Additional contact information
R. A. Bailey: Queen Mary and Westfield College, School of Mathematical Sciences

A chapter in Designs and Finite Geometries, 1996, pp 45-77 from Springer

Abstract: Abstract A survey is given of the statistical theory of orthogonal partitions on a finite set. Orthogonality, closure under suprema, and one trivial partition give an orthogonal decomposition of the corresponding vector space into subspaces indexed by the partitions. These conditions plus uniformity, closure under infima and the other trivial partition give association schemes. Examples covered by the theory include Latin squares, orthogonal arrays, semilattices of subgroups, and partitions defined by the ancestral subsets of a partially ordered set (the poset block structures). Isomorphism, equivalence and duality are discussed, and the automorphism groups given in some cases. Finally, the ideas are illustrated by some examples of real experiments.

Keywords: association scheme; block structure; crossing; infimum; nesting; orthogonality; partition; poset; supremum (search for similar items in EconPapers)
Date: 1996
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4613-1395-3_4

Ordering information: This item can be ordered from
http://www.springer.com/9781461313953

DOI: 10.1007/978-1-4613-1395-3_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().