Uniform semi-Latin squares and their pairwise-variance aberrations
DOI10.1016/j.jspi.2020.12.003zbMath1460.62121arXiv2008.10552OpenAlexW3080999886MaRDI QIDQ830735
R. A. Bailey, Leonard H. Soicher
Publication date: 7 May 2021
Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.10552
orthogonal arrayblock designSchur optimalityaffine resolvable designbalanced incomplete-block designdesign optimality
Optimal statistical designs (62K05) Combinatorial aspects of block designs (05B05) Orthogonal arrays, Latin squares, Room squares (05B15) Statistical block designs (62K10)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Symmetric factorial designs in blocks
- Variance and concurrence in block designs, and distance in the corresponding graphs
- Orthogonal arrays. Theory and applications
- Theory of optimal designs
- Optimal and efficient semi-Latin squares
- Algorithms for finding generalized minimum aberration designs
- Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays
- Classification of orthogonal arrays by integer programming
- Enumeration of MOLS of small order
- Designs, Groups and Computing
- Uniform Semi-Latin Squares and Their Schur-Optimality
- A family of balanced incomplete-block designs with repeated blocks on which general linear groups act
- Complete enumeration of pure-level and mixed-level orthogonal arrays
- Optimum continuous block designs
- Construction and optimality of affine-resolvable designs
- Engineering an Efficient Canonical Labeling Tool for Large and Sparse Graphs
- Integer Programming for Classifying Orthogonal Arrays
This page was built for publication: Uniform semi-Latin squares and their pairwise-variance aberrations
