UniqueOverlap: Rigidity and Consistency

• UniqueOverlap is a multifaceted concept defined by overlap rigidity, canonicity, and consistency across tilings, overlapping substitutions, communication models, and optimization frameworks.
• It governs spectral purity in substitution tilings by equating overlap coincidence with multiple strong coincidences, and ensures globally consistent geometric gluing in overlapping substitutions.
• In distributed sketching and planted optimization, UniqueOverlap drives lower bounds and sharp threshold phenomena, revealing structural constraints and extreme behaviors.

In the cited literature, UniqueOverlap is not a single standardized term but a family of overlap-centered notions that express rigidity, canonicity, or extremal behavior. In substitution tilings it denotes the canonicity of overlap coincidence across admissible control-point choices; in overlapping substitutions it denotes globally consistent realization of allowed overlaps; in communication complexity it is the name of a three-party promise problem; in planted optimization it refers to a near-optimal overlap geometry with a forbidden interval; and in several combinatorial and geometric settings it marks sharp thresholds or minimal-overlap counterexamples (Akiyama, 2015, Akiyama et al., 2024, Robinson et al., 15 Jul 2025, Bhamidi et al., 11 May 2026).

1. UniqueOverlap in substitution tilings

For primitive Pisot substitutions and, more generally, for non-rod self-affine tilings with connected tiles, finite local complexity, primitive substitution, and Meyer return set, the central objects are strong coincidence and overlap coincidence. Strong coincidence is formulated on the substitution Delone multi-color set arising from a choice of admissible control points, whereas overlap coincidence is formulated on overlaps $(U,y,V)$ in the tiling itself and requires that every overlap eventually inflates to a coincidence under substitution. The main equivalence theorem states that there exists a level $n=n(T)\ge 1$ such that overlap coincidence is equivalent to multiple strong coincidence of level $n$: for every admissible control-point choice for $\Omega^n$ with $\Lambda-\Lambda\subset G$, the resulting multi-color set admits strong coincidence (Akiyama, 2015).

This result makes the “unique” aspect precise. Changing control points by color-dependent shifts changes the digit sets $D_{ij}$, and strong coincidence can be created or destroyed by that change. The theorem shows that, under the stated Pisot and topological hypotheses, overlap coincidence is nonetheless intrinsic: the tiling has overlap coincidence if and only if strong coincidence holds for all admissible control-point choices in the class constrained by $\Lambda-\Lambda\subset G$ at a fixed level $n(T)$. In this sense, overlap coincidence becomes canonical rather than an artifact of a particular normalization of tiles or control points (Akiyama, 2015).

The same framework yields spectral consequences. Overlap coincidence is equivalent to pure discreteness of the translation action on the tiling space, and it implies pure point dynamical spectrum, pure point diffraction, and the inter-model-set characterization of the associated Delone multi-color set. The Taylor–Socolar half-hexagonal substitution tiling gives a concrete computed example: the Akiyama–Lee overlap-graph algorithm verifies overlap coincidence for the $168$-prototile substitution, and therefore the tiling dynamics has pure point spectrum and quasicrystalline structure (Akiyama et al., 2012).

2. UniqueOverlap as consistency of overlapping substitutions

In the theory of overlapping substitutions, a pre-overlapping substitution is a triple $(B,\phi,\rho)$ in which inflated proto-tiles are replaced by patches that may overlap along boundaries. Here the essential question is not coincidence but consistency: whether iterated substitutions ever create a contradictory overlap, meaning distinct tiles with intersecting interiors inside some $n=n(T)\ge 1$0. In this setting, “UniqueOverlap” is the property that the allowed overlaps are realized in a unique, globally consistent way at every substitution level (Akiyama et al., 2024).

The formalism differs from classical substitution tilings because the associated substitution matrix may have non-integer entries. These entries record fractional coverage, and the right Perron–Frobenius eigenvector gives tile frequencies in the fixed-point tiling. The Perron–Frobenius eigenvalue equals $n=n(T)\ge 1$1, and under finite local complexity and repetitivity the expansion constant is an algebraic integer. Thus overlap is incorporated directly into the substitution matrix rather than treated as a defect to be eliminated (Akiyama et al., 2024).

The uniqueness criteria are dimension-dependent. In one dimension, stabilized adjacency graphs together with matching weighted ends imply that overlaps are uniquely determined and no contradiction appears. In two dimensions, a sufficient condition is given by a graph-directed iterated function system for tile boundaries satisfying the open set condition and the linear GIFS condition; then the boundary pieces are Jordan curves without self-intersection, and the substitution is globally consistent. The resulting “unique overlap” is therefore not spectral canonicity, as in coincidence theory, but uniqueness of admissible geometric gluing (Akiyama et al., 2024).

3. UniqueOverlap as a communication-complexity problem

In distributed sketching and communication complexity, UniqueOverlap is a formally defined three-party simultaneous-message problem. Alice receives $n=n(T)\ge 1$2, Bob receives $n=n(T)\ge 1$3, both supports have size $n=n(T)\ge 1$4, and there is a unique index $n=n(T)\ge 1$5 at which both entries are defined and satisfy $n=n(T)\ge 1$6. The referee Charlie knows the supports and therefore knows the unique overlap index $n=n(T)\ge 1$7; the task is to decide whether $n=n(T)\ge 1$8 or $n=n(T)\ge 1$9 (Robinson et al., 15 Jul 2025).

The central theorem states that for sufficiently large $n$0 there exists $n$1 such that every deterministic zero-error simultaneous-message protocol for $n$2 has communication complexity $n$3. The proof uses “flippable” coordinates induced by short deterministic messages, then converts correctness into a cross-intersection constraint on families of supports, and finally applies Hilton’s bound for cross-intersecting families. The difficulty is specific to the promise structure: Charlie knows the unique intersection coordinate, so standard reductions from set disjointness or indexing do not directly apply (Robinson et al., 15 Jul 2025).

The problem was introduced to prove the first deterministic lower bound for a connectivity decision problem in the distributed sketching model. Via a simulation using indistinguishable separated pairs in a bounded-intersection set family, the paper derives that for any super-constant $n$4, every deterministic zero-error one-round sketching algorithm deciding $n$5-edge connectivity requires worst-case message length $n$6 bits per node. Here “UniqueOverlap” no longer concerns geometry of sets or tilings; it is a communication primitive whose unique overlap index drives a lower-bound reduction (Robinson et al., 15 Jul 2025).

4. UniqueOverlap in planted optimization and overlap geometry

For modularity optimization on the $n$7-block stochastic block model with $n$8, the relevant overlap is between a candidate partition $n$9 and the planted partition $\Omega^n$0, measured by

$\Omega^n$1

The main theorem establishes an overlap gap property for modularity: for any $\Omega^n$2, sufficiently near-optimal partitions satisfy either $\Omega^n$3 or $\Omega^n$4, and far near-optimal partitions do exist. A decoy partition obtained by merging two planted blocks lies at distance $\Omega^n$5 and attains modularity near the optimal value, producing the far basin (Bhamidi et al., 11 May 2026).

Within this landscape, the paper identifies a planted-side “unique overlap” phenomenon. It proves that if $\Omega^n$6, then $\Omega^n$7, where $\Omega^n$8 is determined by

$\Omega^n$9

Thus every partition with modularity sufficiently near optimum is close to the planted partition. Combined with the OGP, near-optimal solutions are either tightly concentrated near $\Lambda-\Lambda\subset G$0 or lie in the decoy basin around distance $\Lambda-\Lambda\subset G$1, with no near-optimal partitions in the intermediate interval. Balanced-partition constraints remove this gap by making the analogous objective strictly decreasing in distance (Bhamidi et al., 11 May 2026).

A useful contrast comes from random Boolean CSP. For random $\Lambda-\Lambda\subset G$2-SAT below density $\Lambda-\Lambda\subset G$3, the set of satisfying assignments forms w.h.p. a single cluster, and for every $\Lambda-\Lambda\subset G$4 there exist satisfying assignments with overlap $\Lambda-\Lambda\subset G$5. For clustered random $\Lambda-\Lambda\subset G$6-SAT near threshold, the overlap distribution has discontinuous support and different clusters are separated by linear Hamming distance. In both regimes, there is no single universal overlap value. This contrast clarifies that “UniqueOverlap” in planted modularity is not literal uniqueness of all overlaps, but rigidity of the near-optimal planted side under a specific objective [0703065].

5. Thresholds, scarcity, and one-point overlap in other settings

Several other works use overlap-related constructions to express sharp thresholds or minimal-overlap pathologies rather than canonicity. In combinatorics on words, every concatenation of $\Lambda-\Lambda\subset G$7 or more binary squares contains an overlap, and the bound $\Lambda-\Lambda\subset G$8 is best possible. Over a ternary alphabet, by contrast, there are infinitely long overlap-free words that are concatenations of squares. Here the salient feature is a sharp forcing threshold: overlap is unavoidable beyond a minimal number of square factors in the binary case (Shallit, 27 May 2026).

In descriptive set theory, there is consistently a Borel set $\Lambda-\Lambda\subset G$9 and a sequence $D_{ij}$0 such that $D_{ij}$1 is uncountable for all $D_{ij}$2, but there is no perfect set $D_{ij}$3 such that every distinct $D_{ij}$4 satisfy $D_{ij}$5. The construction separates “many” uncountable overlaps along a long sequence from “perfectly many” large overlaps, and the threshold $D_{ij}$6 is a technical finite cap rather than an optimal bound (Roslanowski et al., 2023).

In self-similar geometry, an explicit iterated function system on $D_{ij}$7 yields a totally disconnected attractor $D_{ij}$8 with exactly one first-level overlap, namely $D_{ij}$9, while the open set condition still fails. Thus even a unique one-point overlap does not imply OSC. The example is post-critically finite, and when $\Lambda-\Lambda\subset G$0 it fails the weak separation property, hence fails OSC despite the minimal overlap pattern (Kamalutdinov et al., 2018).

A different extremal direction appears in edge unfoldings of convex polyhedra. For the banded geodesic domes $\Lambda-\Lambda\subset G$1 with $\Lambda-\Lambda\subset G$2 vertices, the fraction $\Lambda-\Lambda\subset G$3 of nonoverlapping edge unfoldings tends to $\Lambda-\Lambda\subset G$4 as $\Lambda-\Lambda\subset G$5, with explicit bounds such as $\Lambda-\Lambda\subset G$6. Nonoverlapping unfoldings do exist, but they are asymptotically rare. In this usage, “UniqueOverlap” is best read as prevalence of overlap rather than literal uniqueness (0801.4019).

6. Comparative structure of the term

The collected usages show that UniqueOverlap functions as a contextual label rather than a single technical invariant.

Domain	Meaning of overlap rigidity	Representative result
Substitution tilings	Canonicity of overlap coincidence across admissible control points	Overlap coincidence $\Lambda-\Lambda\subset G$7 multiple strong coincidence at some level $\Lambda-\Lambda\subset G$8 (Akiyama, 2015)
Overlapping substitutions	Unique, contradiction-free realization of allowed overlaps	Consistency from adjacency graphs in 1D and OSC + linear GIFS in 2D (Akiyama et al., 2024)
Communication complexity	Promise problem with a unique overlap coordinate	Deterministic simultaneous-message complexity $\Lambda-\Lambda\subset G$9 (Robinson et al., 15 Jul 2025)
SBM modularity	Near-optimal partitions forced near planted or decoy basins	Modularity has OGP; near-optimal implies near-planted on the planted side (Bhamidi et al., 11 May 2026)
Binary words	Sharp forcing threshold for unavoidable overlaps	$n(T)$0 binary squares force an overlap, and $n(T)$1 is best possible (Shallit, 27 May 2026)
Borel translates	Large overlaps without perfect families of large overlaps	Pairwise uncountable overlaps for $n(T)$2 translates, but no perfect family with pairwise overlap $n(T)$3 (Roslanowski et al., 2023)

A common pattern nonetheless recurs. In each setting, overlap is not merely an incidental intersection relation; it becomes a structural probe of the ambient object. In tilings it detects pure discreteness and model-set structure; in overlapping substitutions it governs global consistency; in communication lower bounds it isolates the irreducible information carried by a single shared coordinate; in planted optimization it encodes the geometry of near-optimal states; and in extremal combinatorics it appears as a sharp obstruction or rarity phenomenon. The term therefore identifies a research theme—control of overlap under strong structural constraints—rather than a single universally adopted definition.