Design theory
Translation nets and fixed-point-free group automorphisms
Journal of Combinatorial Theory Series A
Enumeration of semi-Latin squares
Discrete Mathematics
Stories about Groups and Sequences
Designs, Codes and Cryptography - Special issue dedicated to Hanfried Lenz
Suprema and infima of association schemes
Discrete Mathematics
Multi-letter Youden rectangles from quadratic forms
Discrete Mathematics - Special issue: The 18th British combinatorial conference
Generalized wreath products of association schemes
European Journal of Combinatorics
A generalization of Wallis-Fon-Der-Flaass construction of strongly regular graphs
Journal of Algebraic Combinatorics: An International Journal
Automating the analysis of variance of orthogonal designs
Computational Statistics & Data Analysis
| Hi-index | 0.00 |
A survey is given of the statistical theory of orthogonalpartitions on a finite set. Orthogonality, closure under suprema,and one trivial partition give an orthogonal decomposition ofthe corresponding vector space into subspaces indexed by thepartitions. These conditions plus uniformity, closure under infimaand the other trivial partition give association schemes. Examplescovered by the theory include Latin squares, orthogonal arrays,semilattices of subgroups, and partitions defined by the ancestralsubsets of a partially ordered set (the poset block structures). Isomorphism, equivalence and duality are discussed, and theautomorphism groups given in some cases. Finally, the ideas areillustrated by some examples of real experiments.