Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs

DOI10.46298/DMTCS.6754arXiv1910.02791OpenAlexW3019754552MaRDI QIDQ6131785FDOQ6131785

Authors: Gerold Jäger, Klas Markström, Denys Shcherbak, Lars-Daniel Öhman 

Publication date: 18 April 2024

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

Abstract: In this paper we first study $kimesn$ Youden rectangles of small orders. We have enumerated all Youden rectangles for a range of small parameter values, excluding the almost square cases where $k=n-1$, in a large scale computer search. In particular, we verify the previous counts for $(n,k)=(7,3),(7,4)$, and extend this to the cases $(11,5),(11,6),(13,4)$ and $(21,5)$. For small parameter values where no Youden rectangles exist, we also enumerate rectangles where the number of symbols common to two columns is always one of two possible values, differing by 1, which we call emph{near Youden rectangles}. For all the designs we generate, we calculate the order of the autotopism group and investigate to which degree a certain transformation can yield other row-column designs, namely double arrays, triple arrays and sesqui arrays. Finally, we also investigate certain Latin rectangles with three possible pairwise intersection sizes for the columns and demonstrate that these can give rise to triple and sesqui arrays which cannot be obtained from Youden rectangles, using the transformation mentioned above.

Full work available at URL: https://arxiv.org/abs/1910.02791

zbMATH Keywords

block designsrow-column designsYouden squares

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

This page was built for publication: Small Youden Rectangles, Near Youden Rectangles, and Their Connections to Other Row-Column Designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131785)