EUVIMEDAtrasti EUVIMED
Crossref

Resolvable Triple Arrays

Alexey Gordeev, Lars-Daniel Öhman

The Electronic Journal of Combinatorics · 2026-05-22 · 33 (2)

DOI: 10.37236/14977 ↗

At a glance

Journal article in The Electronic Journal of Combinatorics, published online on 2026-05-22. Written by Alexey Gordeev and 1 co-authors.

SantraukaBibliografiniai duomenysCiteRelated studies

Abstract (original language)

We present a new construction of triple arrays by combining a symmetric 2-design with a resolution of another 2-design. This is the first general method capable of producing non-extremal triple arrays. We call the triple arrays which can be obtained in this way resolvable. We employ the construction to produce the first examples of $(21 \times 15, 63)$-triple arrays, and enumerate all resolvable $(7 \times 15, 35)$-triple arrays, of which there was previously only a single known example. An infinite subfamily of Paley triple arrays turns out to be resolvable. We also introduce a new intermediate object, unordered triple arrays, that are to triple arrays what symmetric 2-designs are to Youden rectangles, and propose a strengthening of Agrawal's long-standing conjecture on the existence of extremal triple arrays. For small parameters, we completely enumerate all unordered triple arrays, and use this data to corroborate the new conjecture. We construct several infinite families of resolvable unordered triple arrays, and, in particular, show that all $((q + 1) \times q^2, q(q + 1))$-triple arrays are resolvable and are in correspondence with finite affine planes of order $q$.

Cite

APA

Gordeev, A., & Öhman, L. (2026). Resolvable Triple Arrays. The Electronic Journal of Combinatorics, 33(2). https://doi.org/10.37236/14977

Vancouver

Gordeev A, Öhman L. Resolvable Triple Arrays. The Electronic Journal of Combinatorics. 2026;33(2). doi:10.37236/14977

BibTeX
@article{Gordeev2026,
  author = {Gordeev, Alexey and Öhman, Lars-Daniel},
  title = {Resolvable Triple Arrays},
  journal = {The Electronic Journal of Combinatorics},
  year = {2026},
  volume = {33},
  number = {2},
  doi = {10.37236/14977}
}
Start for free →