Optimality of some two-associate-class partially balanced incomplete- block designs

DOI10.1214/aos/1176348270zbMath0741.62071OpenAlexW2001457966MaRDI QIDQ1178959

S. Singh

Publication date: 26 June 1992

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aos/1176348270

zbMATH Keywords

regular graph designbinary equireplicate incomplete-block designsconnected two-associate-class partially balanced designoptimality of Trojan squares over semi-Latin squarespartially balanced incomplete-block designsingular concurrence matrixstrongly regular graph design

Mathematics Subject Classification ID

Optimal statistical designs (62K05) Combinatorial aspects of block designs (05B05) Statistical block designs (62K10)

Related Items (29)

Odd and even group divisible designs with two groups and block size four ⋮ Balanced semi-Latin rectangles: properties, existence and constructions for block size two ⋮ Graph-theoretic design and analysis of key predistribution schemes ⋮ Uniform Semi-Latin Squares and Their Schur-Optimality ⋮ A Howell design admitting \(A_ 5\) ⋮ Enumeration of semi-Latin squares ⋮ Optimal partially balanced nested row-column designs ⋮ Constructions for regular-graph semi-Latin rectangles with block size two ⋮ A Spectral Analysis Approach for Experimental Designs ⋮ Optimal regular graph designs ⋮ On optimality of designs with three distinct eigenvalues ⋮ Minimum variance rectangular designs for U-statistics. ⋮ An efficient semi-Latin square for twelve treatments in blocks of size two ⋮ Experiments in rectangular areas: design and randomization ⋮ The robustness of resolvable block designs against the loss of whole blocks or replicates ⋮ Symmetric factorial designs in blocks ⋮ On the optimality of a class of designs with three concurrences ⋮ Research problems from the 19th British Combinatorial Conference ⋮ A new construction for efficient semi-Latin squares ⋮ The Use of Treatment Concurrences to Assess Robustness of Binary Block Designs Against the Loss of Whole Blocks ⋮ A complete class of type 1 optimal block designs with unequal replications ⋮ Sesqui-arrays, a generalisation of triple arrays ⋮ Translation nets and fixed-point-free group automorphisms ⋮ Variance and concurrence in block designs, and distance in the corresponding graphs ⋮ Designs, Groups and Computing ⋮ Substitutes for the non-existent square lattice designs for 36 varieties ⋮ Polygonal designs: Some existence and non-existence results ⋮ Optimal design with many blocking factors. ⋮ Optimality of partial geometric designs

This page was built for publication: Optimality of some two-associate-class partially balanced incomplete- block designs