Search arXivSearch

arXiv · 2605.01813

Latin hypercubes with restricted transversals

Abstract

A $k$-plane of a $d$-dimensional array is a subarray formed by fixing $d-k$ coordinates and allowing the remaining $k$ coordinates to vary freely. A Latin hypercube of dimension $d$ and order $n$ is an $n\times n\times\cdots\times n$ array of dimension $d$ containing symbols from an $n$-set, such that each $1$-plane contains each of the possible entries exactly once. A transversal in a Latin hypercube of order $n$ is a set of $n$ entries of the hypercube, no pair of which agree in any coordinate or contain the same symbol. The aim of this paper is to construct Latin hypercubes that have transversals but which have many entries that are not in any transversal, or for which the number of disjoint transversals is limited. We show the following results in the case when the dimension $d$ is even. For all even $n\ge 10$ there exists a Latin hypercube of order $n$ that contains a transversal but for which all transversals hit one $(d-2)$-plane. For $n\in\{6,8\}$ there exists a Latin hypercube of order $n$ that contains a transversal but for which all transversals hit one of two $(d-2)$-planes. For even $d>2$ there is a Latin hypercube of order $n=4$ that contains a transversal but has $2^d$ entries that are not in any transversal. Our constructions use a quasigroup $(Q,\ast)$ to increase the dimension of a Latin hypercube using the rule $H_d(x_1,\dots,x_d)=H_{d-1}(x_1,\dots,x_{d-1})\ast x_d$. We give several characterisations which allow us to diagnose which entries of $H_d$ are in transversals in terms of properties of $H_{d-1}$ and $Q$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Billy Child, Ian M. Wanless. 2026-05-03. Latin hypercubes with restricted transversals. https://arxiv.org/abs/2605.01813

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO