English

Latin hypercubes with restricted transversals

Combinatorics 2026-05-05 v1

Abstract

A kk-plane of a dd-dimensional array is a subarray formed by fixing dkd-k coordinates and allowing the remaining kk coordinates to vary freely. A Latin hypercube of dimension dd and order nn is an n×n××nn\times n\times\cdots\times n array of dimension dd containing symbols from an nn-set, such that each 11-plane contains each of the possible entries exactly once. A transversal in a Latin hypercube of order nn is a set of nn 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 dd is even. For all even n10n\ge 10 there exists a Latin hypercube of order nn that contains a transversal but for which all transversals hit one (d2)(d-2)-plane. For n{6,8}n\in\{6,8\} there exists a Latin hypercube of order nn that contains a transversal but for which all transversals hit one of two (d2)(d-2)-planes. For even d>2d>2 there is a Latin hypercube of order n=4n=4 that contains a transversal but has 2d2^d entries that are not in any transversal. Our constructions use a quasigroup (Q,)(Q,\ast) to increase the dimension of a Latin hypercube using the rule Hd(x1,,xd)=Hd1(x1,,xd1)xdH_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 HdH_d are in transversals in terms of properties of Hd1H_{d-1} and QQ.

Cite

@article{arxiv.2605.01813,
  title  = {Latin hypercubes with restricted transversals},
  author = {Billy Child and Ian M. Wanless},
  journal= {arXiv preprint arXiv:2605.01813},
  year   = {2026}
}
R2 v1 2026-07-01T12:47:21.982Z