Optimal Equivariant Matchings

• The paper presents translation-invariant matchings on perturbed lattices and K4-equivariant matchings on hypercubes that achieve optimal tail decay and minimal Hamming cost.
• Optimal equivariant matchings are defined as group-invariant bijections that respect symmetry, with applications in discrete Morse theory and combinatorial optimization.
• Methodologies include local dyadic coverings, Hall's marriage theorem, and equivariant patchwork techniques to construct acyclic matchings on posets.

Optimal equivariant matchings are group-invariant bijections between structured sets that minimize a cost functional subject to symmetry constraints. They arise in diverse domains such as combinatorics, discrete geometry, probability theory, and topological combinatorics, targeting scenarios (e.g., lattices, hypercubes, posets) where both a notion of matching and an underlying symmetry group (translation, permutation, or more general group action) are present. Optimality typically refers to achieving minimal total cost, minimal tail decay, or an acyclic Morse matching with the fewest possible unmatched cells compatible with equivariance.

1. Foundational Definitions and Setup

An equivariant matching is a bijection $M: X \rightarrow Y$ between structured sets $X$ and $Y$, each equipped with a group action $G\curvearrowright X, G\curvearrowright Y$, such that $M$ commutes with the $G$-action: $M(g\cdot x) = g\cdot M(x)$ for all $g\in G$ and $x\in X$. The optimality criterion varies by context:

• In metric spaces (e.g., Euclidean lattices, Boolean cubes), the cost is often the summed or maximum distance between matched pairs.
• In discrete Morse theory, optimality entails minimizing the number and dimension of unmatched ("critical") cells, especially up to equivariance.

Classes of equivariant matchings include:

• Translation-invariant matchings on randomly perturbed lattices (Elboim et al., 20 Jun 2025).
• Group-equivariant pairings on Boolean hypercubes under the Klein four-group $K_4$ (Radisic, 12 Jan 2026).
• Acyclic matchings on poset-derived complexes (partition lattices) equivariant under Young subgroups (Donau, 2012).

2. Translation-Invariant Matching on Randomly Perturbed Lattices

Consider the setting of a point process $\Pi = \{v + \xi_v : v \in \mathbb{Z}^d\}$ where lattice points are perturbed by i.i.d. random vectors $\xi_v$ in $\mathbb{R}^d$. A perfect matching $M:\mathbb{Z}^d \rightarrow \Pi$ is translation-invariant if, under shifts $w\in \mathbb{Z}^d$, the distribution of the matching and configuration is preserved: $M(v+w) = M(v) + w$ in law.

The central optimality result [(Elboim et al., 20 Jun 2025), Theorem 1.2] asserts that for natural classes of perturbations (Gaussian, polynomial tails with exponent $\alpha>1$), there exists a translation-invariant perfect matching $M$ whose maximal matching distance tail $\Pr(\|M(0)\|\ge r)$ decays as the hole-probability lower bound $h(r) = \Pr(\Pi\cap B_r = \emptyset)$. Explicitly,

$\Pr(\|M(0)\|\ge r) \le h(r)^c$

for some $c>0$, with $h(r)$ sharply characterized by the tail of the perturbation law.

The construction leverages a random dyadic cover of $\mathbb{R}^d$ by boxes adapted to the local configuration, ensuring via Hall's marriage theorem that each box absorbs all the perturbed points crossing it. Control of the crossing-count per box—using regularity and integrability assumptions on the tail $p(r)$—guarantees both existence and tail-optimality of the matching.

This result is tight in Gaussian and sufficiently regular polynomial cases, while a phase transition (no longer optimal tail) arises for very heavy-tailed perturbations in $d=1$.

3. Group Equivariant Matchings and Combinatorial Cost-Minimization

On the Boolean hypercube $Q_n = \{0,1\}^n$, consider the action of the Klein four-group $$K_4 = \{\mathrm{id}, \mathrm{comp}, \mathrm{rev}, \mathrm{comp}\circ\mathrm{rev}\}$$, where $\mathrm{comp}(x)$ is bitwise complement and $\mathrm{rev}(x)$ is reversal. A perfect matching $M$ is $K_4$-equivariant if the pairing commutes with the group.

For $n=6$, the optimal problem is to minimize the total Hamming cost $\sum d_H(x,y)$ among $K_4$-equivariant matchings using only $\mathrm{comp}$ or $\mathrm{rev}$ pairings (Radisic, 12 Jan 2026). The unique solution is the reverse-priority rule:

• Pair $x$ with $\mathrm{rev}(x)$ unless $x = \mathrm{rev}(x)$ (palindrome), in which case pair with $\mathrm{comp}(x)$.

This rule achieves total cost $120$ (palindrome and antisymmetric: always $6$; generic: half $2$, half $4$), compared to $192$ for the "complement-only" matching. Allowing also the mixed involution $\mathrm{comp}\circ\mathrm{rev}$ can drive the cost further down to $96$, but loses rule uniformity. The optimality is verified via exhaustive computation and formalization in Lean 4.

Notably, the King Wen sequence from the I Ching manifests the reverse-priority matching, and is rigorously shown to be isomorphic to it under binary encoding.

4. Equivariant Discrete Morse Theory and Minimality on Posets

In the context of the partition lattice $\Pi_n$ (partitions of $[n]$ ordered by refinement), acyclic matchings on the nerve $\Delta(\Pi_n)$ offer topological insight into the structure of quotient complexes under group actions (Donau, 2012). For the Young subgroup $G=S_1\times S_{n-1}$:

• Construction proceeds via a G-equivariant projection $\varphi$ to a two-tier poset, fiberwise acyclic matchings per-orbit, and gluing by the Equivariant Patchwork Theorem.
• The equilibrium yields unmatched simplices only in dimensions $0$ and $n-3$: exactly one $0$-cell (vertex) and $(n-1)!$ top-dimensional critical simplices, forming a single $G$-orbit.
• This minimality is optimal by representation-theoretic lower bounds for $G$-equivariant CW complexes.

This optimal acyclic matching, together with new tools (equivariant patchwork, small-fiber map construction), advances equivariant discrete Morse theory and applies broadly to posets with symmetry.

5. Construction Techniques and Theoretical Tools

Typical methods for optimal equivariant matching, as abstracted from these results, involve:

• Covering space by adapted regions (e.g., dyadic boxes in the lattice setting) with local combinatorial constraints, ensuring enough capacity for matching.
• Hall’s marriage theorem for existence, applied to local structure via crossing-count conditions.
• Equivariant projection to simpler posets and decomposition into fibers, matched with induction and then patched globally.
• Minimization via analysis of group orbits—pairings chosen per orbit by local cost or symmetry.
• Acyclicity ensured by patchwork theorems and control of alternating cycles.

Group actions and their orbit structure play a central role both in constraining admissible matchings and in formulating minimality.

6. Examples, Sharpness, and Generalizations

Key model cases sharpen the above principles:

• Gaussian perturbations ($p(r)\propto e^{-r^2}$): matching distance tails decay as $e^{-r^{d+2}}$, achieved by the equivariant construction (Elboim et al., 20 Jun 2025).
• Polynomial tails ($p(r)\sim r^{-\alpha},\ \alpha>1$): tail $\exp(-c r^d\log r)$, also sharp.
• Boolean cube under $K_4$: reverse-priority cost $120$, complement-only cost $192$, mixed-involution cost $96$ (Radisic, 12 Jan 2026).
• Partition lattice: minimal $(n-1)!$ top-dimensional critical cells; CW complex homotopy equivalent to a wedge of spheres, number determined by group orbits (Donau, 2012).

A plausible implication is that, in combinatorial and geometric settings with symmetry, the per-orbit analysis and local minimal pairing strategies generalize to higher structures, provided group regularity and tail decay conditions are met.

7. Applications and Formal Verification

Applications span combinatorial optimization, topological combinatorics, stochastic geometry, and theoretical computer science (including matching structures in Lean 4 (Radisic, 12 Jan 2026)). Formal proofs and computer-checked verification (Lean/Mathlib) solidify the correctness of the constructions and optimality assertions. The exemplification by the King Wen sequence underscores the cultural and mathematical resonance of optimal equivariant matching paradigms.

Future directions include extending these frameworks to other group actions, continuous symmetry settings, non-metric cost functionals, and high-dimensional generalizations. The interplay between probability, combinatorics, and geometry remains central to further advances.