Uniform Pairings in Design Theory & Beyond

• Completely uniform pairings are balanced pair structures where every pair appears with equal or near-equal multiplicity across various contexts, such as nested Steiner quadruple systems and algebraic tensor product pairings.
• They reveal a universal symmetry law that governs pair distributions in settings ranging from Euclidean space and abelian groups to additive representations and random perfect matchings.
• This concept underpins several constructions and proofs, enabling rigorous analyses in design theory, geometric pair correlations, algebraic bilinear maps, and combinatorial randomness.

Searching arXiv for the cited papers and related uses of “completely uniform pairings.” arXiv_search query: "all:(Raman et al., 2017) OR all:(Mrabet et al., 2013) OR all:(Chen et al., 2015) OR all:(Czédli, 2019) OR all:(Deng, 20 May 2025) OR all:(Huang, 2020) OR all:(Shen et al., 16 Apr 2025) OR all:(Lu, 8 Sep 2025)" arXiv_search query: "\"completely uniform\" pairings OR \"nested SQS\" OR \"pair correlations\" OR tensor product pairings" “Completely Uniform Pairings” is not a single standardized term across contemporary arXiv literature. The phrase is used most explicitly in design theory for nested Steiner quadruple systems, where it denotes exact equality of pair multiplicities, but closely related ideas also occur in geometric pair-correlation theory, tensor-product-based algebraic pairings, additive representation functions, lattice tolerances, random perfect matchings, and modular-arithmetic matchings (Lu, 8 Sep 2025). This suggests that the common core is not a specific formalism but a family of balance principles: pair statistics, pair incidences, or pair-induced structures become independent of local arithmetic or combinatorial irregularities and are governed instead by a universal symmetry law (Raman et al., 2017, Mrabet et al., 2013).

1. Terminological scope

Across the cited literature, “uniformity” refers to different but structurally analogous constraints on pairs.

Setting	Paired object	Uniformity condition
Countable sets in $\mathbb{R}^n$	Distances between pairs	Limiting law equals Euclidean volume law
Finite abelian groups	Bilinear maps $A\times B\to C$	Non-degenerate factorization through $A\otimes B$
Integer sets	Two-term additive representations	$R_A(n)=R_B(n)$ for all $n$
Lattices	2-element tolerance blocks	All blocks have size $2$
Perfect matchings	Matched edges in sparse subgraphs	Asymptotically independent Poisson counts
Nested SQSs	Chosen pair partitions of 4-blocks	Every pair appears with equal multiplicity

The design-theoretic usage is the most literal. A nested Steiner quadruple system is completely uniform if every pair in $\binom{V}{2}$ appears as a nested pair with the same multiplicity, and completely quasi-uniform if every pair appears and multiplicities differ by at most one (Lu, 8 Sep 2025).

Other papers use no such exact term, but they supply rigorous analogues. In geometric pair correlation, large truncations $T\cap B_n(R)$ have normalized pair distances distributed exactly as if two points were chosen independently and uniformly from the $n$-ball (Raman et al., 2017). In algebra, pairings are treated uniformly through the tensor product, with existence governed by the canonical bilinear map $A\times B\to A\otimes B$ (Mrabet et al., 2013).

2. Geometric pair uniformity in Euclidean spaces

For a countable set $A\times B\to C$0, pair uniformity is formulated through large-ball truncations and normalized macroscopic distances. Writing

$A\times B\to C$1

the required hypotheses are an angular equidistribution condition on $A\times B\to C$2 and a radial growth condition

$A\times B\to C$3

Under these assumptions, counts of points in large star-shaped regions are asymptotic to normalized Euclidean volume, and the same volume heuristic lifts from $A\times B\to C$4 to $A\times B\to C$5 (Raman et al., 2017).

The relevant pair-counting region is

$A\times B\to C$6

so the cumulative distribution function of normalized pair distance $A\times B\to C$7 is obtained from

$A\times B\to C$8

The limiting density is

$A\times B\to C$9

which depends only on Euclidean geometry and not on arithmetic particulars of $A\otimes B$0 (Raman et al., 2017).

This notion is explicitly not local Poissonian pair correlation in the sense used for fine-scale spacing problems. The normalization is macroscopic, $A\otimes B$1, and the result concerns the global distance law inside $A\otimes B$2. For $A\otimes B$3 and $A\otimes B$4 the density has closed forms, while as $A\otimes B$5 the measure concentrates at $A\otimes B$6, formally

$A\otimes B$7

Lattice points and primitive lattice points satisfy the hypotheses, so their normalized pair-distance law is the same geometric law (Raman et al., 2017).

3. Algebraic and categorical pairings

In algebra, a pairing is a non-degenerate bilinear map. The unifying mechanism is the tensor product: for abelian groups or, more generally, $A\otimes B$8-modules,

$A\otimes B$9

so every bilinear map factors uniquely through the canonical bilinear map

$R_A(n)=R_B(n)$0

(Mrabet et al., 2013).

The central structural point is that non-degeneracy of this canonical map is a universal obstruction criterion. If some pairing $R_A(n)=R_B(n)$1 exists, then $R_A(n)=R_B(n)$2 must be non-degenerate. In the self-pairing case, the theory is especially strong: for every finite abelian group $R_A(n)=R_B(n)$3, the canonical map

$R_A(n)=R_B(n)$4

is non-degenerate, hence itself a pairing (Mrabet et al., 2013).

The tensor product is computed explicitly on cyclic decompositions: $R_A(n)=R_B(n)$5 and if

$R_A(n)=R_B(n)$6

then

$R_A(n)=R_B(n)$7

This yields a genuinely uniform formalism, but not a single fixed codomain for all $R_A(n)=R_B(n)$8; existence remains structure-sensitive, and for finite abelian $R_A(n)=R_B(n)$9-groups a necessary condition for a pairing $n$0 is $n$1 (Mrabet et al., 2013).

A second algebraic line studies finite abelian $n$2-groups equipped with alternating or Hermitian perfect pairings. There the paired objects form modules over the classical Hall algebra, with basis indexed by groups with pairings, and the structure constants are related explicitly to Hall-Littlewood polynomials at different values of the parameter $n$3. The same framework yields expectation formulas with respect to Cohen–Lenstra type measures on groups with pairings; in the alternating case this provides a new and simpler proof of previous results of Delaunay–Jouhet (Shen et al., 16 Apr 2025). This suggests a different kind of uniformity: not flat counting of raw bilinear forms, but automorphism-weighted distributions on self-dual paired objects.

4. Additive and order-theoretic uniformity

In additive combinatorics, pair uniformity appears as exact equality of two-term representation functions. For $n$4,

$n$5

counts unordered representations of $n$6 as a sum of two distinct elements of $n$7. The construction

$n$8

preserves equality $n$9 under the avoidance condition

$2$0

and the limiting sets $2$1, $2$2 can satisfy $2$3 while having both infinite symmetric difference and infinite intersection (Chen et al., 2015).

The flagship example starts from $2$4, $2$5 and yields

$2$6

Thus complete additive matching of pair-sum counts does not force sets to be disjoint, equal, or structurally close (Chen et al., 2015).

In lattice theory, a 2-uniform tolerance is a compatible tolerance relation all of whose blocks have size $2$7. For lattices with no infinite chain, two 2-uniform tolerances permute if and only if they are amicable, and any two 2-uniform congruences permute (Czédli, 2019). Here “uniform pairings” means that the local compatible blocks are all 2-element convex sublattices. The paper stresses, however, that a 2-uniform tolerance is not literally a disjoint perfect matching: a tolerance need not be transitive, and blocks need not partition the lattice in the way congruence classes do (Czédli, 2019).

5. Random perfect matchings and balanced arithmetic pairings

A probabilistic version of complete pair uniformity is given by uniformly random perfect matchings. If $2$8 is chosen uniformly from all perfect matchings of $2$9, then for any fixed finite collection of pairwise edge-disjoint subgraphs $\binom{V}{2}$0 with $\binom{V}{2}$1,

$\binom{V}{2}$2

jointly converges in total variation to independent Poisson random variables with means

$\binom{V}{2}$3

The same phenomenon holds for uniformly random balanced perfect matchings in $\binom{V}{2}$4, now with means $\binom{V}{2}$5 (Deng, 20 May 2025).

At the level of single edges, the inclusion probabilities are exact: $\binom{V}{2}$6 for $\binom{V}{2}$7, and

$\binom{V}{2}$8

for the balanced multipartite model. For a bounded-degree sparse subgraph $\binom{V}{2}$9,

$T\cap B_n(R)$0

This is a rare-event form of pair uniformity: sparse edge statistics behave as if incidences were asymptotically independent (Deng, 20 May 2025).

A highly rigid arithmetic analogue occurs for primes $T\cap B_n(R)$1. With

$T\cap B_n(R)$2

the set $T\cap B_n(R)$3 decomposes into $T\cap B_n(R)$4 ordered pairs $T\cap B_n(R)$5 such that $T\cap B_n(R)$6. For two distinct pairs, exactly one of the three order types

$T\cap B_n(R)$7

occurs, and the counts of these three types are equal: $T\cap B_n(R)$8 The pairing is therefore balanced in the strongest possible sense among pair-of-pair relative positions (Huang, 2020).

6. Completely uniform pairings in nested design theory

The most explicit formalization appears in nested Steiner quadruple systems. A nested $T\cap B_n(R)$9 is obtained by replacing each 4-block with one of its three partitions into two disjoint pairs. It is completely uniform if every pair in $n$0 appears with equal multiplicity, and completely quasi-uniform if every pair appears and multiplicities differ by at most one (Lu, 8 Sep 2025).

Necessary arithmetic conditions are immediate from counting. Since an $n$1 has

$n$2

blocks, a completely uniform nested $n$3 must have common pair multiplicity

$n$4

so $n$5. If complete uniformity is impossible, the quasi-uniform case forces $n$6, with pair multiplicities

$n$7

occurring on $n$8 and $n$9 pairs, respectively (Lu, 8 Sep 2025).

The principal existence theorem concerns the Boolean $A\times B\to A\otimes B$0: $A\times B\to A\otimes B$1 For every integer $A\times B\to A\otimes B$2, there exists a nested $A\times B\to A\otimes B$3 derived from the Boolean $A\times B\to A\otimes B$4, which is completely uniform when $A\times B\to A\otimes B$5 is odd and completely quasi-uniform when $A\times B\to A\otimes B$6 is even (Lu, 8 Sep 2025). The construction passes through affine-orbit $A\times B\to A\otimes B$7-$A\times B\to A\otimes B$8 subdesigns. Each such orbit admits a completely uniform nested pairing by choosing a base nested block

$A\times B\to A\otimes B$9

and taking its orbit under $A\times B\to C$00. Because this affine group is sharply 2-transitive, every pair occurs exactly once in each nested $A\times B\to C$01-design orbit (Lu, 8 Sep 2025).

The odd-even dichotomy comes from an exceptional affine orbit. If $A\times B\to C$02 is odd, the Boolean $A\times B\to C$03 decomposes entirely into $A\times B\to C$04-$A\times B\to C$05 pieces, yielding complete uniformity. If $A\times B\to C$06 is even, one exceptional orbit is only a $A\times B\to C$07-$A\times B\to C$08 design, so the total system is only completely quasi-uniform (Lu, 8 Sep 2025).

The same paper generalizes the notion to $A\times B\to C$09-designs with $A\times B\to C$10, establishes the existence of completely uniform $A\times B\to C$11-$A\times B\to C$12 nested designs for all $A\times B\to C$13, and applies them to fractional repetition codes with zero skip cost. For $A\times B\to C$14, the resulting FR code has

$A\times B\to C$15

and uses fewer storage nodes than the construction based on SQSs, with node-count ratio

$A\times B\to C$16

Small non-Boolean examples are also provided, establishing the existence of completely uniform nested $A\times B\to C$17 for all $A\times B\to C$18 with $A\times B\to C$19 (Lu, 8 Sep 2025).

The literature therefore supports a broad but coherent interpretation. “Completely Uniform Pairings” denotes exact or asymptotic indistinguishability of pairs under the statistic appropriate to the ambient structure: Euclidean distance, bilinear evaluation, additive representation, tolerance blocks, sparse-edge incidence, or pair multiplicity in a design. What varies from paper to paper is the mechanism—equidistribution, tensor-product universality, recursive symmetry, local compatibility, Poisson approximation, or sharply 2-transitive group action—but the underlying theme is the same: pair structure becomes governed by a universal balance law rather than by incidental local asymmetry.