Covering Arrays in Combinatorics

• Covering arrays are combinatorial matrices that ensure every t-wise interaction among parameters appears at least once, providing rigorous test coverage.
• They are constructed using probabilistic methods, group-theoretic techniques, and algorithmic tools like the Lovász Local Lemma to achieve minimal test sizes.
• Applications span software testing, combinatorial design, and extremal set theory, driving research on asymptotic bounds and optimal configurations.

A covering array is a fundamental combinatorial object, central to interaction testing, combinatorial design, and extremal set theory. It is an $N \times k$ array over a $v$-ary alphabet in which every $N \times t$ subarray contains all possible $v^t$ tuples in its rows, guaranteeing exhaustive coverage of all $t$-way interactions among $k$ parameters, each with $v$ levels. The covering array number $\mathrm{CAN}(t, k, v)$ is the minimum $N$ for which such an array exists.

1. Formal Definitions and Basic Properties

A covering array $\mathrm{CA}(N; t, k, v)$ is an $v$0 matrix $v$1 over $v$2 with the property

$v$3

The covering array number: $v$4 Orthogonal arrays $v$5 require each $v$6-tuple to appear exactly $v$7 times in every $v$8-column subarray; covering arrays require at least one occurrence. Covering arrays generalize orthogonal arrays and provide the minimal test size needed to guarantee $v$9-wise coverage (Hiess et al., 20 Oct 2025).

2. Asymptotic Bounds and Constructions

Logarithmic Growth

The classical result (Katona–Kleitman–Godbole) is

$N \times t$0

for fixed $N \times t$1, $N \times t$2 and $N \times t$3 (Francetić et al., 2015).

Probabilistic and Analytical Bounds

The Lovász Local Lemma (LLL) yields: $N \times t$4 with more refined constructions, e.g., fixed-weight columns, improving constants for small $N \times t$5 and $N \times t$6 (Yuan et al., 2014).

Entropy-compression (algorithmic LLL) further refines constants: $N \times t$7 and, via multivariable optimization, to (Francetić et al., 2015): $N \times t$8 for $N \times t$9.

3. Exact Results for Small Parameters and Uniqueness

Binary Arrays and Strength Two

For $v^t$0, $v^t$1, maximal binary 2-covering arrays are unique up to equivalence, given by the standard maximal array—an $v^t$2 matrix whose columns are all binary vectors of fixed weight (Choi et al., 2011).

Computational Determination

Modern computational methods (isomorph-free exhaustive search, canonical augmentation) have determined exact optimal covering arrays for 21 strength-two cases with $v^t$3, $v^t$4 (Kokkala et al., 2019). All exhibit uniformity (equal symbol-frequency in each column).

4. Generalizations: Mixed, Hypergraph, and Sequence Covering Arrays

Mixed Covering Arrays

Generalized covering designs handle multi-part alphabets and block sizes, providing lower and upper bounds via Schőnheim's bound, edge-counting, and recursive constructions (Bailey et al., 2010). Partial and mixed-level arrays are realized by partial covering arrays and hypergraph-based models.

Hypergraph Covering Arrays

Covering arrays on $v^t$5-uniform hypergraphs restrict coverage to prescribed interactions, e.g., only certain triples. Inductive construction uses hooking operations (vertex/edge additions), achieving optimally small arrays for $v^t$6-acyclic and conformal hypertrees (Akhtar et al., 2015).

Sequence and Perfect Sequence Covering Arrays

Sequence covering arrays (SCAs) are sets of permutations covering all ordered $v^t$7-subsequences; perfect sequence covering arrays (PSCAs) require exact multiplicity $v^t$8 (Na et al., 2022, Gentle et al., 2022). The minimal such $v^t$9 is denoted $t$0. For $t$1, $t$2; for $t$3, $t$4 (Na et al., 2022). PSCAs are tightly connected to directed designs and deletion-correcting codes.

5. Partial and Relaxed Covering Arrays

Relaxed requirements give rise to partial covering arrays, covering only a fraction of $t$5-sets or tuples (Sarkar et al., 2016). Important results:

• Partial covering arrays with fraction $t$6:

$t$7

• $t$8-almost covering arrays:

$t$9

Moser–Tardos resampling and Markov-type randomized algorithms ensure efficient generation, matching information-theoretic lower bounds up to constant factors.

6. Arrays with Higher Index (Replication) and Constraints

Covering Arrays of Index $k$0

For $k$1 (every $k$2-tuple occurs at least $k$3 times), the main asymptotic bound is (Calbert et al., 2022): $k$4 removing previous $k$5 terms. Improved leading constants are obtained via the Lovász Local Lemma and two-stage alteration schemes; graph coloring yields further reductions for higher $k$6.

SAT/MaxSAT-Based Construction

Satisfiability-based encodings of the covering array problem allow for exact and suboptimal solving, even under additional constraints (forbidden tuples, system-specific restrictions) (Ansótegui et al., 2021). MaxSAT variants minimize test suite size; incomplete MaxSAT is especially effective on large-scale constrained problems.

7. Algebraic and Group-Theoretic Constructions

Finite Field and Group Development Constructions

Maximal sequences (m-sequences), cyclic trace arrays, and group actions (e.g., PGL$k$7) are exploited to yield covering arrays of high strength and efficiency (Maity et al., 2015, Tzanakis, 2017). For strength $k$8, $k$9, explicit bounds $v$0 are achieved using projective general linear group constructions and starter vectors. For binary arrays, concatenation of cyclic Hamming codes, self-dual sequence families, interleaving, and primitive polynomial periodicity yield near-optimal covering sequences and arrays (Chee et al., 12 Feb 2025, Chee et al., 2024).

8. Open Problems and Current Research Directions

Key open areas include:

• Determining $v$1 for more small ($v$2) and high strength ($v$3) parameter sets (Hiess et al., 20 Oct 2025).
• Improving leading constants and sharpening lower bounds, especially for partial arrays and arrays of higher index.
• Extending algebraic and group-theoretic constructions to broader parameter ranges, especially using cyclotomy and discrete logarithms (Tzanakis, 2017).
• Classification and existence problems for mixed, hypergraph, and constrained covering arrays.
• Connections to perfect sequence covering arrays, deletion codes, and directed $v$4-designs.
• Systematic study of optimal arrays for non-binary alphabets and verification of the uniformity conjecture (Kokkala et al., 2019).
• Efficient SAT/MaxSAT and enumeration algorithms capable of exact or near-optimal constructions in real-world, large-scale systems.

Table: Summary of Covering Array Number Bounds

Type	Primary Bound or Complexity	Reference
Classical ($v$5-way, full)	$v$6; $v$7	(Sarkar et al., 2016)
Logarithmic growth ($v$8 fixed)	$v$9	(Francetić et al., 2015)
Probabilistic/LLL bound	$\mathrm{CAN}(t, k, v)$0	(Yuan et al., 2014)
Entropy compression	$\mathrm{CAN}(t, k, v)$1	(Francetić et al., 2015)
Higher index $\mathrm{CAN}(t, k, v)$2	$\mathrm{CAN}(t, k, v)$3	(Calbert et al., 2022)
Small $\mathrm{CAN}(t, k, v)$4 (exact)	$\mathrm{CAN}(t, k, v)$5 columns	(Choi et al., 2011)
Partial/relaxed coverage	$\mathrm{CAN}(t, k, v)$6 for small relaxations	(Sarkar et al., 2016)
Algebraic/group development ($\mathrm{CAN}(t, k, v)$7)	Polynomial/construction-dependent	(Maity et al., 2015)

Covering arrays remain a rich, continually evolving domain at the intersection of extremal combinatorics, algorithmic theory, algebraic design, and practical test suite optimization.