Triple arrays from difference sets
From MaRDI portal
Abstract: This paper addresses the question whether triple arrays can be constructed from Youden squares developed from difference sets. We prove that if the difference set is abelian, then having as multiplier is both a necessary and sufficient condition for the construction to work. Using this, we are able to give a new infinite family of triple arrays. We also give an alternative and more direct version of the construction, leaving out the intermediate step via Youden squares. This is used when we analyse the case of non-abelian difference sets, for which we prove a sufficient condition for giving triple arrays. We do a computer search for such non-abelian difference sets, but have not found any examples satisfying the given condition.
Recommendations
Cited in
(10)- The seven classes of 5 6 triple arrays
- Aspects of optimality of plans orthogonal through other factors and related multiway designs
- Triple arrays and related designs
- Double arrays, triple arrays and balanced grids
- Double arrays, triple arrays and balanced grids with \(v=r+c-1\).
- A note on the construction of incomplete row-column designs: an algorithmic approach
- Sesqui-arrays, a generalisation of triple arrays
- scientific article; zbMATH DE number 2230934 (Why is no real title available?)
- Intercalates in double and triple arrays
- Resolvable triple arrays
This page was built for publication: Triple arrays from difference sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4600161)