The existence spectrum of near triple arrays with four rows
Abstract
In the 1950s and 1960s, Agrawal introduced a class of experimental designs that later became known as triple arrays. Gordeev, Markström and Öhman proposed near triple arrays by relaxing all three intersection properties of triple arrays, allowing two values concentrated around the average intersection size, as well as two consecutive values for the replication numbers. They completely resolved the existence of near triple arrays with three rows, showing that there exists a (3× c,v)-near triple array if and only if v≥ c≥ 3 except for (c,v)∈{(3,6),(4,6),(5,8)}. In this paper, we further investigate the existence of near triple arrays with four rows and prove that there exists a (4× c,v)-near triple array if and only if v≥ c≥ 4 except for (c,v)∈{ (4,9),(5,7),(5,10),(6,8),(7,9),(10,12),(11,13)}.
Related
- On the existence of mixed orthogonal arrays of strength two with six factors
- Completing the Existence Problem for Integer Relative Heffter Arrays Hk(n;k)
- Steady symmetric Navier-Stokes flow near Poiseuille flow: existence and vanishing viscosity limit
- Beamfocusing Beyond the Near Field: Frequency Diverse Arrays for OFDM-ISAC Systems
- Global existence and uniqueness for the planar four-velocity Broadwell model with arbitrary C1 bounded initial and boundary data in a rectangular domain
BibTeX
@misc{chen2026existence,
title = {{The existence spectrum of near triple arrays with four rows}},
author = {GuangZhou Chen and Yaxin Yue and Yong Zhang},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.23584},
eprint = {2609.23584},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.23584},
}
RIS
TY - UNPB
TI - The existence spectrum of near triple arrays with four rows
AU - GuangZhou Chen
AU - Yaxin Yue
AU - Yong Zhang
PY - 2026
DA - 2026/09/20
PB - arXiv
DO - 10.48550/arxiv.2609.23584
UR - https://arxiv.org/abs/2609.23584
AB - In the 1950s and 1960s, Agrawal introduced a class of experimental designs that later became known as triple arrays. Gordeev, Markström and Öhman proposed near triple arrays by relaxing all three intersection properties of triple arrays, allowing two values concentrated around the average intersection size, as well as two consecutive values for the replication numbers. They completely resolved the existence of near triple arrays with three rows, showing that there exists a (3× c,v)-near triple array if and only if v≥ c≥ 3 except for (c,v)∈{(3,6),(4,6),(5,8)}. In this paper, we further investigate the existence of near triple arrays with four rows and prove that there exists a (4× c,v)-near triple array if and only if v≥ c≥ 4 except for (c,v)∈{ (4,9),(5,7),(5,10),(6,8),(7,9),(10,12),(11,13)}.
ER -