Sesqui-arrays, a generalisation of triple arrays
From MaRDI portal
Publication:4614036
zbMATH Open1404.05014arXiv1706.02930MaRDI QIDQ4614036FDOQ4614036
Authors: R. A. Bailey, Peter J. Cameron, Tomas Nilson
Publication date: 30 January 2019
Abstract: A triple array is a rectangular array containing letters, each letter occurring equally often with no repeats in rows or columns, such that the number of letters common to two rows, two columns, or a row and a column are (possibly different) non-zero constants. Deleting the condition on the letters common to a row and a column gives a double array. We propose the term emph{sesqui-array} for such an array when only the condition on pairs of columns is deleted. Thus all triple arrays are sesqui-arrays. In this paper we give three constructions for sesqui-arrays. The first gives arrays on letters for . (Such an array for was found by Bagchi.) This construction uses Latin squares. The second uses the emph{Sylvester graph}, a subgraph of the Hoffman--Singleton graph, to build a good block design for treatments in blocks of size~, and then uses this in a sesqui-array for letters. We also give a construction for sesqui-arrays on letters. This construction uses biplanes. It starts with a block of a biplane and produces an array which satisfies the requirements for a sesqui-array except possibly that of having no repeated letters in a row or column. We show that this condition holds if and only if the emph{Hussain chains} for the selected block contain no -cycles. A sufficient condition for the construction to give a triple array is that each Hussain chain is a union of -cycles; but this condition is not necessary, and we give a few further examples. We also discuss the question of which of these arrays provide good designs for experiments.
Full work available at URL: https://arxiv.org/abs/1706.02930
Recommendations
Cites Work
- Title not available (Why is that?)
- The analysis of randomized experiments with orthogonal block structure. I. Block structure and the null analysis of variance
- On Moore Graphs with Diameters 2 and 3
- Title not available (Why is that?)
- Arrays of distinct representatives --- a very simple NP-complete problem
- Optimality of some two-associate-class partially balanced incomplete- block designs
- Combinatorics of optimal designs
- Title not available (Why is that?)
- Theory of optimal designs
- Title not available (Why is that?)
- A new class of resolvable incomplete block designs
- Title not available (Why is that?)
- Finite Nets, I. Numerical Invariants
- On the optimality of a class of row-column designs
- Double arrays, triple arrays and balanced grids
- Algebra of a row-column design
- Three-Factor Additive Designs More General Than the Latin Square
- Title not available (Why is that?)
- On the optimality of a new class of adjusted orthogonal designs
- Relations among partitions
- Title not available (Why is that?)
- Triple arrays and Youden squares
- Designs with partial neighbour balance
- Title not available (Why is that?)
- A remark on the construction of designs for two-way elimination of heterogeneity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On two-way designs
- The seven classes of \(5\times 6\) triple arrays
- Title not available (Why is that?)
- Title not available (Why is that?)
- Triple arrays from difference sets
- Title not available (Why is that?)
Cited In (7)
- Double arrays, triple arrays and balanced grids
- A note on the construction of incomplete row-column designs: an algorithmic approach
- Title not available (Why is that?)
- Triple arrays and related designs
- Title not available (Why is that?)
- Substitutes for the non-existent square lattice designs for 36 varieties
- Triple arrays and Youden squares
This page was built for publication: Sesqui-arrays, a generalisation of triple arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4614036)