Tree-Like Gluing: Recursive Constructions & Applications

• Tree-like gluing is a recursive method that constructs complex structures by systematically attaching new components to tree-like frameworks.
• It finds applications in probability theory, enumerative combinatorics, metric geometry, and quantum field theory, enabling precise control over fractal and topological properties.
• The technique employs specific approaches such as line-breaking, bijective combinatorics, and operator-based methods to yield both enumerative and structural insights.

Tree-like gluing refers to a class of combinatorial and geometric constructions wherein complex structures—graphs, metric spaces, algebraic and geometric objects—are built recursively by attaching new components onto previously constructed trees or tree-like objects. The concept is foundational across probability theory, enumerative combinatorics, metric geometry, mathematical physics, and complex geometry. The unifying principle is the recursive extension and “aggregation” of a tree structure by gluing in a well-defined manner, controlling topological, metric, or combinatorial properties in the limit. Tree-like gluing yields rich families of objects (random real trees, maps of prescribed genus, stable trees, subdivergence-free graphs, degenerate Calabi-Yau manifolds) whose fine structure and enumeration are governed by the details of the gluing process.

1. Recursive Gluing in the Construction of Random $\mathbb{R}$-Trees

The standard model for tree-like gluing in random $\mathbb R$-trees is the line-breaking construction. Given a deterministic or random sequence of branch lengths $(a_n)$, a sequence of compact real $\mathbb R$-trees $(\mathcal{T}_n)$ is defined recursively. The procedure is:

• Initialize $\mathcal{T}_1$ as a segment of length $a_1$.
• For each $n \geq 2$, sample a “gluing point” $X_n$ from the normalized length measure $\mu_{n-1}$ on $\mathbb R$0, and attach a new segment of length $\mathbb R$1 at $\mathbb R$2 to create $\mathbb R$3.
• Equip each $\mathbb R$4 with the natural geodesic metric and define the limit tree $\mathbb R$5, yielding a (possibly unbounded) complete $\mathbb R$6-tree.

The geometric and fractal properties of the limiting object depend crucially on the asymptotic decay of the $\mathbb R$7. For $\mathbb R$8, two regimes are distinguished:

• $\mathbb R$9: The limiting tree $(a_n)$0 is a compact random fractal of Hausdorff dimension $(a_n)$1.
• $(a_n)$2: The tree is compact, the skeleton has dimension 1, but the set of leaves acquires dimension $(a_n)$3.

This paradigm includes Aldous’s Brownian continuum random tree (CRT) as the case $(a_n)$4, and extends to self-similar stable trees (Curien et al., 2014, Goldschmidt et al., 2014).

2. Structural and Enumerative Models: Polygon Gluings and Unicellular Maps

In combinatorics, tree-like gluing arises in bijections between unicellular maps (one-face graph embeddings) and decorated trees. A unicellular map with $(a_n)$5 edges corresponds to a gluing of a $(a_n)$6-gon along paired edges, producing a surface of prescribed genus $(a_n)$7. The combinatorial structure is captured by C-decorated trees, pairs $(a_n)$8 where $(a_n)$9 is a plane tree and $\mathbb R$0 is a cycle-signed permutation (a C-permutation) whose cycle structure encodes the genus:

• Each cycle in $\mathbb R$1 has odd length and sign.
• The genus $\mathbb R$2 is determined by $\mathbb R$3.

A bijection allows the translation of enumeration problems for maps into counting problems for trees with permutation data, yielding straightforward derivations of the Lehman–Walsh, Harer–Zagier, and Goupil–Schaeffer formulas, and drastically simplifying the underlying combinatorial analysis (Chapuy et al., 2012).

3. Subdivergence-Free Gluing in Quantum Field Theory and Graph Enumeration

A distinct notion of tree-like gluing appears in the context of subdivergence-free gluings of rooted trees, relevant to Feynman graph combinatorics. Here, two rooted trees $\mathbb R$4 and $\mathbb R$5 (with equal numbers of leaves) are glued by identifying leaves according to a bijection, contracting resulting 2-valent vertices. Subdivergence-freeness is a constraint prohibiting any 2-edge cut from disconnecting the glued graph $\mathbb R$6 into two components, both of which are disconnected from the roots and unglued leaves; this is motivated by exclusions of vacuum subgraphs in perturbative QFT.

Key developments include:

• Enumeration in infinitely many families (e.g., line-trees $\mathbb R$7, fans $\mathbb R$8, branched pairs $\mathbb R$9), with explicit closed formulas in terms of connected permutations and inductive recursions.
• The use of connected permutations $(\mathcal{T}_n)$0 (permutations in $(\mathcal{T}_n)$1 fixing no proper prefix) to enumerate admissible matchings.
• Recursive and cut-preprocessing algorithms for generic trees, equipped with dynamic programming (partial gluings) and admissible cut enumerations, enabling efficient calculation of subdivergence-free counts (Dai et al., 2021).

Glued Family	Subdiv.-free Counts	Method of Enumeration
$(\mathcal{T}_n)$2	$(\mathcal{T}_n)$3 (number of connected perms)	Prefix avoidance in permutations
$(\mathcal{T}_n)$4 (fan)	$(\mathcal{T}_n)$5	All leaf matchings allowed
$(\mathcal{T}_n)$6	Closed form via inclusion–exclusion	Branch/side cut combinatorics

4. Stable Trees and Generalizations: Self-Similar Line-Breaking Models

The line-breaking construction for $(\mathcal{T}_n)$7-stable trees ($(\mathcal{T}_n)$8) extends the recursive gluing paradigm:

• Edge-lengths arise as increments of an explicit increasing Markov chain $(\mathcal{T}_n)$9 with generalized Mittag–Leffler law, split at each step via a Beta-distributed partition parameter.
• At each stage, a new segment is attached either at a uniform point (by length) or at a branch-point, with explicit distributional and combinatorial rules.
• The resulting metric tree is the $\mathcal{T}_1$0-stable continuum random tree, which interpolates between purely binary (Brownian) and more highly ramified limits.
• Self-similar fragmentation and mass-partition structure are exposed, with Poisson–Dirichlet laws emerging naturally from the recursive gluing (Goldschmidt et al., 2014).

This construction subsumes Aldous’s CRT as the case $\mathcal{T}_1$1 and fully determines the fractal geometry (Hausdorff dimension $\mathcal{T}_1$2, packing dimension, spectral properties) of stable trees.

5. Tree-like Gluing in Degenerate Complex Geometry

In the degeneration of Calabi–Yau metrics on affine hypersurfaces, tree-like gluing refers to the assembly of bubble-tree structures as singular fibers of a fibration separate:

• The global manifold $\mathcal{T}_1$3 is constructed as the fibration

$\mathcal{T}_1$4

where fibers $\mathcal{T}_1$5 as $\mathcal{T}_1$6.

• Each collision pattern of singular fibers is encoded as a rooted tree ($\mathcal{T}_1$7), with vertices representing limit Calabi–Yau models and edges corresponding to neck-regions or rescaling limits.
• Gluing parameters $\mathcal{T}_1$8 control scales of necks and fiber blow-ups; cutoff families delineate local models.
• The construction rigorously verifies conjectured asymptotic behavior (Yang Li’s conjecture), producing a metric glued from warping and matching of local QAC Calabi–Yau pieces along the tree (Yan, 2024).

6. Gluing Operators in Scattering Amplitudes and Chiral Theories

In theoretical physics, particularly the scattering amplitudes framework, tree-like gluing is implemented via explicit gluing operators:

• In the CHY/ambitwistor string formalism, an operator

$\mathcal{T}_1$9

enforces the worldsheet-level propagation and factorization by sewing together sphere correlators at prescribed nodes, reproducing field theory factorization properties and undergirding recursion formulas for tree-level amplitudes.

• The operator is bi-local, pairing off-shell insertions, non-local Wilson line factors $a_1$0, and an integration over the loop (or sewing) momentum $a_1$1. BRST invariance, propagator pole structure, and worldsheet factorization properties are all made manifest (Roehrig et al., 2017).

Recursive applications of the gluing operator reconstruct higher-point and higher-genus correlators from simpler building blocks, cohering with the tree-like logic in other settings.

7. Summary and Unifying Themes

Tree-like gluing provides a recursive and constructive basis for a diverse array of mathematical structures:

• Metric and probabilistic $a_1$2-trees with finely tunable fractal geometry.
• Bijective and structural combinatorics of maps and permutations.
• Counts and classifications of graph gluings with physical significance (e.g., subdivergence-free in QFT).
• Models of degeneration and singularity formation in complex geometry.
• Operator-based assembly of field theory amplitudes and moduli space structure in quantum field theory.

The distinguishing feature across all cases is the recursive aggregation—either random or deterministic, metric or combinatorial—of pieces via attachment at prescribed loci in a growing tree structure, with asymptotic, enumerative, or structural consequences determined by the rules of gluing. This renders tree-like gluing a central unifying tool for analytical, probabilistic, and combinatorial constructions in modern mathematics and theoretical physics (Curien et al., 2014, Dai et al., 2021, Roehrig et al., 2017, Yan, 2024, Goldschmidt et al., 2014, Chapuy et al., 2012).