On the optimality of block designs
A family of highly efficient designs in the sense of the E-criterion is described. These designs have strictly better E-performance than regular graph designs, yet the off-diagonal entries of their C-matrix differ by as much as two. Some counterexamples to conjectures in experimental design are then supplied. Asymptotic behavior and equivalence of the A- and D-criteria under a certain condition of uniqueness are analyzed as well.
scientific article; zbMATH DE number 3945149