Orthogonal partitions in designed experiments

Research output: Contribution to journalArticlepeer-review

42 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)45-77
Number of pages33
JournalDesigns, Codes and Cryptography
Volume8
Publication statusPublished - 1996

Keywords

  • association scheme
  • block structure
  • crossing
  • infimum
  • nesting
  • orthogonality
  • partition
  • poset
  • supremum

Fingerprint

Dive into the research topics of 'Orthogonal partitions in designed experiments'. Together they form a unique fingerprint.

Cite this