Gasket Decomposition (Borot, Bouttier, Guitter)

• The paper introduces a combinatorial framework that decomposes loop-decorated triangulations into a rooted planar map (gasket), encoding the geometry and nesting of loops.
• It develops recursive and integral equations for partition functions, revealing critical behavior and loop-perimeter scaling exponents within the fully packed loop-O(n) and FK models.
• The method unifies combinatorial, probabilistic, and spectral techniques to provide actionable insights into universality and critical phenomena in planar map models.

The gasket decomposition introduced by Borot, Bouttier, and Guitter (BBG) provides a combinatorial framework for analyzing the fully packed loop-$O(n)$ model on planar triangulations. This method translates a loop-decorated triangulation into a rooted planar map ("gasket") with additional combinatorial data encoding the embedded loops. The decomposition enables enumeration and asymptotic analysis of models ranging from the fully packed loop-$O(n)$ model to the Fortuin–Kasteleyn (FK) model at its self-dual point. The approach systematically encodes the geometry and nesting of loops within planar maps, yielding recursive and integral equations for partition functions and observables, with implications for map criticality and universality classes (Berestycki et al., 5 Dec 2025).

1. Definition of the Gasket and Decomposition Bijection

Given a rooted planar triangulation $t$ with boundary (root face) of degree $\ell$, decorated by a fully-packed configuration $L$ of non-intersecting simple loops (each visiting every internal face exactly once), the total weight is defined as

$$Z(t,L; x, n) = x^{\#(\text{internal triangles})} n^{\#(\text{loops})},$$

with associated partition function

$$F_\ell = \sum_{(t,L)\ \text{on boundary}\ \ell} Z(t,L; x, n).$$

The gasket $G$ of $(t,L)$ is the submap consisting of edges reachable from the boundary without crossing any loop. Due to the fully packed nature of $L$, $O(n)$0 is a rooted planar map. Its faces comprise one external face of degree $O(n)$1, and, for each loop of $O(n)$2 whose external perimeter is $O(n)$3, a corresponding internal face of degree $O(n)$4. The decomposition is realized via a combinatorial bijection:

$O(n)$5

2. Algorithmic Decomposition: Stepwise Construction of the Gasket

The decomposition proceeds as follows:

1. Identify all edges reachable from the boundary without crossing a loop—these form the gasket $O(n)$6, with external boundary of length $O(n)$7.
2. Each loop in $O(n)$8 forms an annular region; removing gasket edges yields, for each loop of perimeter $O(n)$9, an internal face of $t$0 with degree $t$1.
3. Reinsert triangles intersected by the loop, creating a triangular ring of boundary lengths $t$2 (outer) and $t$3 (inner), together with a loop-decorated triangulation of boundary $t$4 filling the interior.

In schematic notation:

$t$5

for each face of $t$6 of degree $t$7.

3. Functional Equations and Fixed-Point Relations

The enumeration yields functional relations for the partition functions. For $t$8 and loop-weight $t$9:

• Let $\ell$0 denote the number of planar rings of triangles with outer boundary $\ell$1 and inner boundary $\ell$2.
• The contribution $\ell$3 for a face of degree $\ell$4 in the gasket satisfies:

$\ell$5

Assigning weight $\ell$6 to each face of a rooted map $\ell$7 with boundary $\ell$8, the total Boltzmann weight of all gaskets of boundary $\ell$9 is $L$0. Defining the resolvent

$L$1

one obtains, by loop-equation/Motzkin-path methods, that $L$2 is analytic off a single interval $L$3 and satisfies

$L$4

with asymptotics $L$5 as $L$6.

4. Recursive Characterization and the One-Cut Ansatz

The resolvent $L$7 and support $L$8 are uniquely determined by the so-called one-cut lemma: for any nonnegative weights $L$9, there is at most one solution analytic off $$Z(t,L; x, n) = x^{\#(\text{internal triangles})} n^{\#(\text{loops})},$$0, regular at infinity, and real on the cut. The fixed-point and functional relations are:

• $$Z(t,L; x, n) = x^{\#(\text{internal triangles})} n^{\#(\text{loops})},$$1
• $$Z(t,L; x, n) = x^{\#(\text{internal triangles})} n^{\#(\text{loops})},$$2

Self-dual (critical) 2-coloring occurs at $$Z(t,L; x, n) = x^{\#(\text{internal triangles})} n^{\#(\text{loops})},$$3, uniquely forcing $$Z(t,L; x, n) = x^{\#(\text{internal triangles})} n^{\#(\text{loops})},$$4; this is confirmed via matching to the hamburger–cheeseburger bijection for the self-dual FK($$Z(t,L; x, n) = x^{\#(\text{internal triangles})} n^{\#(\text{loops})},$$5) model ($$Z(t,L; x, n) = x^{\#(\text{internal triangles})} n^{\#(\text{loops})},$$6). The singular integral for the spectral density

$$Z(t,L; x, n) = x^{\#(\text{internal triangles})} n^{\#(\text{loops})},$$7

is reduced via a convolution in the uniformizing variable $$Z(t,L; x, n) = x^{\#(\text{internal triangles})} n^{\#(\text{loops})},$$8, with Wiener–Hopf factorization yielding explicit forms for $$Z(t,L; x, n) = x^{\#(\text{internal triangles})} n^{\#(\text{loops})},$$9 and $$F_\ell = \sum_{(t,L)\ \text{on boundary}\ \ell} Z(t,L; x, n).$$0.

5. Exact Solution, Critical Behaviour, and Implications

At the self-dual point $$F_\ell = \sum_{(t,L)\ \text{on boundary}\ \ell} Z(t,L; x, n).$$1 and $$F_\ell = \sum_{(t,L)\ \text{on boundary}\ \ell} Z(t,L; x, n).$$2 with $$F_\ell = \sum_{(t,L)\ \text{on boundary}\ \ell} Z(t,L; x, n).$$3, the parameters are

$$F_\ell = \sum_{(t,L)\ \text{on boundary}\ \ell} Z(t,L; x, n).$$4

The spectral density is

$$F_\ell = \sum_{(t,L)\ \text{on boundary}\ \ell} Z(t,L; x, n).$$5

with $$F_\ell = \sum_{(t,L)\ \text{on boundary}\ \ell} Z(t,L; x, n).$$6 an explicit normalization constant. The partition function follows as

$$F_\ell = \sum_{(t,L)\ \text{on boundary}\ \ell} Z(t,L; x, n).$$7

with asymptotics for large $$F_\ell = \sum_{(t,L)\ \text{on boundary}\ \ell} Z(t,L; x, n).$$8:

$$F_\ell = \sum_{(t,L)\ \text{on boundary}\ \ell} Z(t,L; x, n).$$9

This matches predictions of Gaudin and Kostov and characterizes the non-generic critical phase, exhibiting a loop-perimeter exponent $G$0 (Berestycki et al., 5 Dec 2025). The rigorous confirmation of the one-cut ansatz through probabilistic bijection methods and analytic combinatorics sharpens previous results on cluster and loop perimeter asymptotics.

6. Connections to Related Models and Further Results

The gasket decomposition is bijectively equivalent to methodologies employed in the analysis of the FK model on planar maps (parameter $G$1), particularly at the self-dual point. These techniques provide a "dictionary" relating combinatorial, probabilistic, and spectral quantities of interest. The approach justifies functional ansätze commonly utilized in analytic combinatorics, and the results generalize aspects of the critical behaviour observed in the loop–$G$2 model on the hexagonal lattice (Nienhuis universality). The method establishes exact and asymptotic expressions for partition functions, cluster perimeter distributions, and phase exponents. Recent work (Berestycki et al., 5 Dec 2025) confirms, refines, and provides new rigorous asymptotics for loop perimeter and map features, enhancing and supplanting previous results from (Berestycki et al., 2015) and (Gwynne et al., 2015).