Some aspects of simplicity in the analysis of block designs

DOI10.1016/0378-3758(82)90085-4zbMath0514.62083OpenAlexW1970403851MaRDI QIDQ1051381

Bikas Kumar Sinha

Publication date: 1982

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0378-3758(82)90085-4

zbMATH Keywords

information matrixMoore-Penrose inversetransitive groupgroup-theoretic approachcharacterizations of partially balanced incomplete block designsgroup balanced block designsLatin square property of C-matrixsimplicity of analysis of block designs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25) Statistical block designs (62K10)

Related Items (4)

Unbiased sequential estimation of 1/p: Settlement of a conjecture ⋮ On complete classes of experiments for certain invariant problems of linear inference ⋮ General balance and treatment permutations ⋮ Variance and concurrence in block designs, and distance in the corresponding graphs

Cites Work

• On Linear Associative Algebras Corresponding to Association Schemes of Partially Balanced Designs
• Invariant Problems of Linear Inference and Related Designs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Some aspects of simplicity in the analysis of block designs