Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2609.23584

The existence spectrum of near triple arrays with four rows

GuangZhou Chen·Yaxin Yue·Yong Zhang
View original source ↗Read source document ↗Export metadata ↓

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\times c,v)$-near triple array if and only if $v\geq c\geq 3$ except for $(c,v)\in\{(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\times c,v)$-near triple array if and only if $v\geq c\geq 4$ except for $(c,v)\in\{ (4,9),(5,7),(5,10),(6,8),(7,9),(10,12),(11,13)\}$.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

GuangZhou Chen, Yaxin Yue, Yong Zhang. 2026-09-20. The existence spectrum of near triple arrays with four rows. https://arxiv.org/abs/2609.23584

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗