Ample Sets in Combinatorics and Design

• Ample sets are structures defined in two distinct contexts: in the Boolean cube by a combinatorial equality condition and in design theory by uniform multiplicity in Steiner systems.
• In the Boolean cube, ample sets satisfy the Dress–Pajor inequality and yield weakly convex cubihedra, facilitating isometric embeddings in ℓ₁-spaces.
• In design theory, ample sets (or large sets with multiplicity) ensure each k-subset appears uniformly, enabling recursive constructions and advanced design configurations.

In contemporary research usage, ample sets denotes at least two distinct technical notions. In combinatorics on the Boolean cube, an ample set is a family $L\subseteq\{\pm1\}^E$ characterized by equality in the Dress–Pajor inequality and, equivalently, by a canonical $\ell_1$-geometric realization as a weakly convex cubical complex (Bandelt et al., 29 Mar 2026). In design theory, the same phrase is also used for large sets with multiplicity, written $LS(t,k,n;\mu)$, namely multisets of Steiner systems on a common point set such that every $k$-subset occurs in exactly $\mu$ constituent systems (Etzion et al., 2020). These usages are mathematically unrelated, and the distinction is essential.

1. Terminological scope

The Boolean-cube notion originates in the theory of lopsided sets. Lopsided sets were introduced by Jim Lawrence in 1983 in connection with the intersection pattern of a convex set $K$ with the orthants of ${\mathbb R}^E$, and Andreas Dress later called them ample sets (Bandelt et al., 29 Mar 2026). In this setting, the ambient object is a family of sign vectors in $\{\pm1\}^E$.

In design theory, by contrast, an ample set is a multiset of Steiner systems or related designs with a prescribed multiplicity parameter $\mu$. The notation $LS(t,k,n;\mu)$ is used for an ample set of Steiner systems $\ell_1$0, and $\ell_1$1 for a large set of $\ell_1$2-designs (Etzion et al., 2020). Here the ambient objects are designs on a finite point set rather than sign-vector families.

Usage	Ambient object	Defining condition
Ample/lopsided set	$\ell_1$3	$\ell_1$4, equivalently $\ell_1$5
Ample set in design theory	Multiset of $\ell_1$6	Every $\ell_1$7-subset occurs in exactly $\ell_1$8 constituent systems

A common source of confusion is that in the first usage “ample” is a structural equality condition, whereas in the second it is a uniform multiplicity condition.

2. Ample sets in the Boolean cube

Fix a finite ground set $\ell_1$9, with $LS(t,k,n;\mu)$0, and let $LS(t,k,n;\mu)$1. For $LS(t,k,n;\mu)$2, define

$LS(t,k,n;\mu)$3

From these one obtains

$LS(t,k,n;\mu)$4

The simplices of $LS(t,k,n;\mu)$5 are the subsets of $LS(t,k,n;\mu)$6 shattered by $LS(t,k,n;\mu)$7, and those of $LS(t,k,n;\mu)$8 are strongly shattered (Bandelt et al., 29 Mar 2026).

Dress observed that every $LS(t,k,n;\mu)$9 satisfies the combinatorial inequality

$k$0

An ample set is defined by equality on the right: $k$1 Equivalently, ampleness is the same as the “sparse” formulation

$k$2

This notion does not refer to cardinal largeness in any naive sense. Rather, it singles out those families for which the upper and lower combinatorial bounds collapse to equality. A plausible implication is that ampleness should be understood as a rigidity condition on the interaction between projections, extensions, and cube-combinatorics, rather than as a measure of size alone.

3. Cubihedra, weak convexity, and sign-vector structure

Let

$k$3

be the standard $k$4-cube, endowed with the $k$5-metric

$k$6

For $k$7, its cubihedron is

$k$8

Its vertices are exactly the elements of $k$9, its edges are the pairs in $\mu$0 at Hamming distance $\mu$1, and its higher-dimensional faces are the subcubes all of whose vertices lie in $\mu$2 (Bandelt et al., 29 Mar 2026).

The decisive metric theorem states that for $\mu$3, the following are equivalent: $\mu$4 is ample; $\mu$5 is weakly convex; $\mu$6 is path–$\mu$7-isometric in $\mu$8; and every nonempty face of $\mu$9 is gated in the sense of Dress–Scharlau (Bandelt et al., 29 Mar 2026). Here weak convexity means completeness together with Menger-convexity, namely that for any two distinct points $K$0 there exists $K$1 such that

$K$2

This places ample sets among the cubical complexes that embed isometrically into $K$3-spaces. The paper further shows that the cubihedra of ample sets endowed with the intrinsic $K$4-metric are exactly the isometric subspaces of $K$5-spaces, called weakly convex sets (Bandelt et al., 29 Mar 2026).

The face structure admits a sign-vector description in $K$6. For a face $K$7, its barycenter defines a sign vector $K$8. The set

$K$9

satisfies

${\mathbb R}^E$0

where ${\mathbb R}^E$1 consists of the cocircuits of ${\mathbb R}^E$2. The family ${\mathbb R}^E$3 satisfies a signed-circuit axiom (SCA), and a set ${\mathbb R}^E$4 is ample if and only if its cocircuits satisfy SCA (Bandelt et al., 29 Mar 2026). The paper explicitly frames this as an analogy with oriented matroids via covectors and cocircuits.

A further characterization concerns realizability. For a set ${\mathbb R}^E$5, let

${\mathbb R}^E$6

Lawrence had shown that ${\mathbb R}^E$7 is ample whenever ${\mathbb R}^E$8 is convex. The converse proved in the geometric paper is that ${\mathbb R}^E$9 is ample if and only if there exists a weakly convex set $\{\pm1\}^E$0 with $\{\pm1\}^E$1, and one may take $\{\pm1\}^E$2, compact and weakly convex (Bandelt et al., 29 Mar 2026).

4. Ample sets as large sets with multiplicity

In design theory, let $\{\pm1\}^E$3 be an $\{\pm1\}^E$4-element set. A Steiner system $\{\pm1\}^E$5 on $\{\pm1\}^E$6 is a collection $\{\pm1\}^E$7 of $\{\pm1\}^E$8-subsets such that each $\{\pm1\}^E$9-subset of $\mu$0 lies in exactly one block. An ample set in this sense is written $\mu$1 and defined as a multiset $\mu$2 of Steiner systems $\mu$3 on the same point set $\mu$4, with the property that each $\mu$5-subset $\mu$6 occurs as a block in exactly $\mu$7 of the $\mu$8 (Etzion et al., 2020).

Equivalently,

$\mu$9

and

$LS(t,k,n;\mu)$0

This is a direct generalization of an ordinary large set, which corresponds to multiplicity $LS(t,k,n;\mu)$1.

Existence is constrained first by the existence of the underlying Steiner system itself. The usual divisibility conditions require

$LS(t,k,n;\mu)$2

Hence $LS(t,k,n;\mu)$3 can exist only if $LS(t,k,n;\mu)$4 exists. In the specific case of Steiner quadruple systems $LS(t,k,n;\mu)$5, one needs

$LS(t,k,n;\mu)$6

For $LS(t,k,n;\mu)$7-designs $LS(t,k,n;\mu)$8, the necessary and sufficient conditions are

$LS(t,k,n;\mu)$9

(Etzion et al., 2020).

The design-theoretic literature emphasizes Steiner quadruple systems and related $\ell_1$00-designs because explicit large sets are difficult to construct. The multiplicity formulation relaxes exact partitioning and replaces it by uniform coverage with parameter $\ell_1$01.

5. Constructions and existence theorems

The principal existence results in this direction are stated for both $\ell_1$02 and $\ell_1$03 families. For any integers $\ell_1$04 and $\ell_1$05 there exists an $\ell_1$06. For each $\ell_1$07 there exists an $\ell_1$08. If there exists an $\ell_1$09 and a perpendicular array $\ell_1$10, then there exists an $\ell_1$11; if $\ell_1$12 and $\ell_1$13 with $\ell_1$14 exist, then there is an $\ell_1$15; and under the same hypotheses, for every $\ell_1$16 there exists an $\ell_1$17 (Etzion et al., 2020).

Ingredient	Output	Statement
$\ell_1$18 + $\ell_1$19	$\ell_1$20	Theorem 4
$\ell_1$21 + $\ell_1$22	$\ell_1$23	Theorem 7
$\ell_1$24 + $\ell_1$25	$\ell_1$26	Theorem 16

The construction toolkit is heterogeneous. Orthogonal arrays $\ell_1$27 yield large sets of orthogonal arrays $\ell_1$28 by a translation trick, and these feed into $\ell_1$29-constructions. Perpendicular arrays $\ell_1$30, equivalently $\ell_1$31-homogeneous sets of permutations in $\ell_1$32, act on the blocks of a single Steiner system to produce $\ell_1$33. One-factorizations of the complete graph and Latin squares underlie the doubling constructions, while the quadrupling construction partitions $\ell_1$34 into four levels and organizes doubled systems on two-level slices together with inter-slice blocks of configuration $\ell_1$35 (Etzion et al., 2020).

The recursive theme is explicit. Starting from $\ell_1$36, one builds $\ell_1$37, then $\ell_1$38, and then continues by a Boolean $\ell_1$39 gluing to reach $\ell_1$40 for all $\ell_1$41 (Etzion et al., 2020). The paper describes the general proof pattern as a partition of $\ell_1$42-subsets by slice configurations, application of designs on each slice, addition of inter-slice blocks, and verification by counting that each relevant subset occurs exactly $\ell_1$43 times.

Several concrete examples are recorded. A computer-searched $\ell_1$44 on $\ell_1$45 consists of $\ell_1$46 Steiner $\ell_1$47, with the other $\ell_1$48 obtained from one representative by explicitly listed coordinate permutations. From it one derives $\ell_1$49 by deleting a point and $\ell_1$50 by extension. An $\ell_1$51 is obtained by applying $\ell_1$52 explicit permutations to one $\ell_1$53 derived from $\ell_1$54. Known existence statements listed in the survey include $\ell_1$55 for all $\ell_1$56, $\ell_1$57, $\ell_1$58, $\ell_1$59, and $\ell_1$60 for all $\ell_1$61 (Etzion et al., 2020).

6. Related terminology and open directions

A third usage of the adjective appears in model theory as very ampleness. In that setting, a strongly minimal set $\ell_1$62 is called very ample if there exists a strongly minimal plane curve $\ell_1$63 whose generic type is very ample, and equivalently there is a definable very ample family of plane curves in $\ell_1$64 (Castle et al., 2022). This is distinct from both the Boolean-cube notion of ample sets and the design-theoretic notion of large sets with multiplicity.

The model-theoretic results include: any strongly minimal set internal to an expansion of an algebraically closed field is very ample; if a strongly minimal set $\ell_1$65 is very ample and non-orthogonal to another strongly minimal set $\ell_1$66, then $\ell_1$67 is internal to $\ell_1$68; very ample strongly minimal sets admit very ample families of plane curves of all dimensions; and divisible strongly minimal groups are very ample (Castle et al., 2022). These statements belong to stability theory and geometric model theory rather than to combinatorial design theory or Boolean-cube geometry.

For design-theoretic ample sets, the open problems explicitly listed are to construct $\ell_1$69 or $\ell_1$70 of minimal size for larger $\ell_1$71 to drive down $\ell_1$72; extend the quadrupling and recursion beyond $\ell_1$73; find explicit small-$\ell_1$74 $\ell_1$75 for new parameter sets such as $\ell_1$76 with multiplicity; and determine the exact minimal $\ell_1$77 for which $\ell_1$78 exists (Etzion et al., 2020).

Taken together, these lines of work show that ample is a term of strong local meaning rather than a universal concept. In one branch it identifies those Boolean-cube families whose combinatorics, cubical geometry, and sign-vector axioms coincide; in another it denotes uniformly multiplicative families of Steiner systems and $\ell_1$79-designs; and in yet another it appears as part of the distinct model-theoretic notion of very ampleness.