Volume Recursion Schemes

• Volume recursion schemes are recursive formulas that compute volumes of spaces and polytopes by breaking them down into measurable lower-dimensional components using integral and combinatorial methods.
• Mirzakhani’s recursion exemplifies these schemes by expressing Weil–Petersson volumes of hyperbolic moduli spaces in terms of simpler geometric pieces derived from pants decompositions and hyperbolic identities.
• Extensions of these schemes include applications to graph polytopes, q-deformations, and quantum invariants, linking discrete geometry with topological recursion and mathematical physics.

A volume recursion scheme is a recursive computational formalism or algorithmic structure that computes the volumes—typically with respect to some natural geometric or combinatorial measure—of families of spaces, polytopes, moduli, or combinatorial objects, by expressing these volumes in terms of strictly “smaller” volumes of lower-dimensional or lower-complexity components. Such schemes are deeply connected with algebraic geometry, Teichmüller theory, low-dimensional topology, combinatorics, and mathematical physics, and they underlie major advances in the recursive computation of moduli space volumes, graph polytope measures, intersection theory, and quantum invariants.

1. Classical Examples: Mirzakhani Recursion and Stable Moduli Volumes

A prototypical volume recursion is the Mirzakhani recursion for the Weil–Petersson volumes $V_{g,n}(L_1,\dots,L_n)$ of the moduli space $\mathcal{M}_{g,n}(L)$ of genus-$g$ hyperbolic surfaces with $n$ geodesic boundaries of specified lengths $L_i$. Mirzakhani’s recursion expresses $V_{g,n}$ in terms of integrals over $V_{g',n'}$ for strictly simpler pairs $(g',n')$, utilizing the geometric combinatorics of the pants decomposition and hyperbolic length identities emerging from generalized McShane identities. The structure of the recursion reflects the topological reduction of moduli spaces under cutting along simple closed geodesics, summarized by integral formulas such as:

$$\frac{\partial}{\partial L_1}[2 L_1 V_{g,n}(L_1,\dots,L_n)] = \sum_{i=2}^n \int_0^\infty x V_{g,n-1}(x,\hat L_{1,i}) [H(x,L_1+L_i)+H(x,L_1-L_i)] dx +\cdots$$

where $H$ is a “gap function” directly linked to hyperbolic geometry (Huang, 2015).

The polynomial structure of these volumes (as even polynomials in $\mathcal{M}_{g,n}(L)$0 of total degree $\mathcal{M}_{g,n}(L)$1) enables the recursion to act purely at the level of coefficients, which are closely connected to intersection numbers of $\mathcal{M}_{g,n}(L)$2-classes on the Deligne–Mumford compactification.

2. Graph Polytope and Convex Volume Recursions

In combinatorial and discrete geometry, recursive volume schemes also govern the computation of polytope volumes associated to graphs. Given a finite simple graph $\mathcal{M}_{g,n}(L)$3 with $\mathcal{M}_{g,n}(L)$4, the associated graph polytope

$\mathcal{M}_{g,n}(L)$5

has volume $\mathcal{M}_{g,n}(L)$6 satisfying the Recursive Volume Formula (RVF) (Lee et al., 2015): $\mathcal{M}_{g,n}(L)$7 where $\mathcal{M}_{g,n}(L)$8 is the induced subgraph obtained by deleting vertex $\mathcal{M}_{g,n}(L)$9. This “facet decomposition” reflects the polyhedral structure of $g$0 and reduces volume computation to lower-dimensional subproblems, generalizing classical inclusion-exclusion and pyramid-decomposition principles in polytope theory.

Applications include closed forms for volumes of complete graphs ($g$1), paths ($g$2), and cycles ($g$3), often related to enumerative combinatorics (e.g., Euler numbers in the path case).

3. Topological Recursion and Quantum Invariants

A fundamental unifying framework is provided by the Eynard–Orantin topological recursion (TR), which recursively defines multidifferentials $g$4 on a fixed “spectral curve.” In the context of moduli volume computations, the TR is Laplace-dual to “volume recursion” in length variables, and it encodes the full hierarchy of recursive relations satisfied by these volumes.

For example, the Masur–Veech volumes $g$5 of the principal stratum of the moduli space of quadratic differentials are the constant terms of a family $g$6 governed by a TR scheme on the curve $g$7, with explicit initial data and recursion kernel involving Hurwitz zeta differentials (Andersen et al., 2019). The recursion at the level of coefficients in the polynomial expansion (in $g$8) is combinatorially interpreted as a sum over stable graphs: $g$9 where the $n$0 coefficients themselves satisfy quadratic “Virasoro-type” recurrences.

TR also links moduli space volumes, ribbon graph enumeration, and matrix model correlators, with specializations including the Airy case (intersection theory of moduli), the Bessel case (spin structures), and Masur–Veech-type twists (quadratic differentials).

4. Extensions: Cones, Non-Orientable Surfaces, and Quantum Deformations

Volume recursion schemes have been extended to broader moduli spaces:

• Hyperbolic cone surfaces: Recursion for the WP volume $n$1 of moduli spaces with both geodesic boundaries and cone points is constructed using generalized McShane identities, with formal “imaginary lengths” for cones and analytic continuation of the hyperbolic gap kernels (Jiang et al., 12 Mar 2026). Such recursions produce polynomiality in both lengths and cone angles and interpolate between classical (boundary) and fully cuspidal (angle zero) settings.
• Non-orientable surfaces: Recursion structures account for crosscaps via new integral kernels, and divergences due to small crosscaps are regulated, resulting in connections to orthogonal symmetry class matrix model loop equations (Stanford, 2023).
• q-analogues: Quantum deformations of Mirzakhani’s volume recursion and its super-extensions are now formulated via $n$2-deformed kernels, producing families of quasi-polynomials with classical limits matching Weil–Petersson volumes as $n$3 (Do et al., 14 Oct 2025).

5. Stable Graph Expansions, Intersection Theory, and Virasoro Constraints

The recursive schemes above admit graph-theoretic expansions: any volume polynomial can be expressed as a sum over stable graphs (dual graphs of nodal curves or ribbon graphs), with each graph weighted by lower-complexity contributions and explicit combinatorial or zeta-function-derived coefficients (Andersen et al., 2019, Fuji et al., 2023). This viewpoint ties the recursive calculation of volumes to intersection numbers on moduli spaces, yielding direct interpretations in terms of integrals of $n$4 and $n$5 classes and explicit polynomiality with degree dictated by the dimension of moduli space.

Furthermore, in the Laplace dual picture, the topological recursion and coefficient recursions are equivalent to infinite sequences of differential (or “Virasoro”) constraints acting on generating functions, with the structure matching that of the Witten–Kontsevich tau function. The emergence of cut-and-join equations and quantum Airy structure relations further demonstrates the deep algebraic and quantum geometry underpinnings of volume recursion schemes (Fuji et al., 2023).

6. Computational and Mathematical Physics Applications

Volume recursion schemes are deployed for explicit enumeration of volumes in low genus and small boundary cases, for verifying conjectural asymptotics, and for generating closed formulas in both classical and quantum-modified settings. Applications in mathematical physics include:

• Closed string field theory: Recursions for systolic volumes dictate the structure of hyperbolic string vertices, yielding quadratic integral equations for classical solutions in closed string field theory (Fırat et al., 2024).
• Quantum invariants: Recursive relations for quantum spin network invariants (e.g., Kauffman brackets) in TQFT provide “circle recursions” that, in exponential scaling limits, recover Schläfli differential equations for hyperbolic polyhedron volumes, supporting conjectures such as the volume conjecture for planar graphs (Costantino et al., 2014).

7. Summary Table: Selected Volume Recursion Schemes

Scheme/Context	Recursion Structure	Reference
Weil–Petersson (Mirzakhani)	Integral/differential recursion in boundaries	(Huang, 2015)
Masur–Veech (Quadratic diff.)	TR on $n$6, stable graphs	(Andersen et al., 2019)
Graph Polytope	Linear recursion via vertex removal	(Lee et al., 2015)
Ribbon Graph Symplectic	Combinatorial cell recursion/TR (Airy)	(Chapman et al., 2010, Bennett et al., 2010)
Cone Point Moduli	Gap kernel integral recursion (analytic cont.)	(Jiang et al., 12 Mar 2026)
q-Deformed Volumes	$n$7-kernel recursion (quasi-polynomial)	(Do et al., 14 Oct 2025)
Non-orientable WP	Crosscap/gluing kernel recursion	(Stanford, 2023)

These recursion schemes constitute a central computational and conceptual toolset in modern geometric topology, Teichmüller theory, and mathematical physics, with a unifying language drawing from topological recursion, matrix models, and enumerative geometry.