Files in this item
Uniform semi-Latin squares and their pairwise-variance aberrations
Item metadata
dc.contributor.author | Bailey, R.A. | |
dc.contributor.author | Soicher, Leonard H. | |
dc.date.accessioned | 2021-12-19T00:41:23Z | |
dc.date.available | 2021-12-19T00:41:23Z | |
dc.date.issued | 2021-07 | |
dc.identifier | 271800775 | |
dc.identifier | cad00ade-154a-4765-a954-6a5a6a24483c | |
dc.identifier | 85099192875 | |
dc.identifier | 000617031900019 | |
dc.identifier.citation | Bailey , R A & Soicher , L H 2021 , ' Uniform semi-Latin squares and their pairwise-variance aberrations ' , Journal of Statistical Planning and Inference , vol. 213 , pp. 282-291 . https://doi.org/10.1016/j.jspi.2020.12.003 | en |
dc.identifier.issn | 0378-3758 | |
dc.identifier.other | RIS: urn:B43C69CDFFA8AB8596BCC2CD002842DE | |
dc.identifier.other | ORCID: /0000-0002-8990-2099/work/85855316 | |
dc.identifier.uri | https://hdl.handle.net/10023/24539 | |
dc.description | The support from EPSRC grant EP/M022641/1 (CoDiMa: a Collaborative Computational Project in the area of Computational Discrete Mathematics) is gratefully acknowledged. | en |
dc.description.abstract | For integers n > 2 and k > 0, an (n×n)∕k semi-Latin square is an n × n array of k-subsets (called blocks) of an nk-set (of treatments), such that each treatment occurs once in each row and once in each column of the array. A semi-Latin square is uniform if every pair of blocks, not in the same row or column, intersect in the same positive number of treatments. It is known that a uniform (n × n)∕k semi-Latin square is Schur optimal in the class of all (n × n)∕k semi-Latin squares, and here we show that when a uniform (n × n)∕k semi-Latin square exists, the Schur optimal (n × n)∕k semi-Latin squares are precisely the uniform ones. We then compare uniform semi-Latin squares using the criterion of pairwise-variance (PV) aberration, introduced by J. P. Morgan for affine resolvable designs, and determine the uniform (n × n)∕k semi-Latin squares with minimum PV aberration when there exist n−1 mutually orthogonal Latin squares of order n. These do not exist when n=6, and the smallest uniform semi-Latin squares in this case have size (6 × 6)∕10. We present a complete classification of the uniform (6 × 6)∕10 semi-Latin squares, and display the one with least PV aberration. We give a construction producing a uniform ((n + 1) × (n + 1)) ∕ ((n − 2)n) semi-Latin square when there exist n − 1 mutually orthogonal Latin squares of order n, and determine the PV aberration of such a uniform semi-Latin square. Finally, we describe how certain affine resolvable designs and balanced incomplete-block designs can be constructed from uniform semi-Latin squares. From the uniform (6 × 6)∕10 semi-Latin squares we classified, we obtain (up to block design isomorphism) exactly 16875 affine resolvable designs for 72 treatments in 36 blocks of size 12 and 8615 balanced incomplete-block designs for 36 treatments in 84 blocks of size 6. In particular, this shows that there are at least 16875 pairwise non-isomorphic orthogonal arrays OA (72,6,6,2). | |
dc.format.extent | 291079 | |
dc.language.iso | eng | |
dc.relation.ispartof | Journal of Statistical Planning and Inference | en |
dc.subject | Design optimality | en |
dc.subject | Block design | en |
dc.subject | Schur optimality | en |
dc.subject | Affine resolvable design | en |
dc.subject | Balanced incomplete-block design | en |
dc.subject | Orthogonal array | en |
dc.subject | QA Mathematics | en |
dc.subject | T-NDAS | en |
dc.subject.lcc | QA | en |
dc.title | Uniform semi-Latin squares and their pairwise-variance aberrations | en |
dc.type | Journal article | en |
dc.contributor.sponsor | EPSRC | en |
dc.contributor.institution | University of St Andrews. Statistics | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | 10.1016/j.jspi.2020.12.003 | |
dc.description.status | Peer reviewed | en |
dc.date.embargoedUntil | 2021-12-19 | |
dc.identifier.grantnumber | EP/M022641/1 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.