[Paper Review] Polynomial recursion formula for linear Hodge integrals

Motohico Mulase, Naizhen Zhang|arXiv (Cornell University)|Aug 17, 2009

Algebraic Geometry and Number Theory29 references5 citations

TL;DR

This paper establishes a polynomial recursion formula for linear Hodge integrals using the Laplace transform of the cut-and-join equation for Hurwitz numbers. The recursion recovers the Witten-Kontsevich theorem via top-degree coefficients and the $λ_g$ formula via lowest-degree terms, providing a unified topological recursion framework for Hodge integrals in terms of polynomial generating functions.

ABSTRACT

We establish a polynomial recursion formula for linear Hodge integrals. It is obtained as the Laplace transform of the cut-and-join equation for the simple Hurwitz numbers. We show that the recursion recovers the Witten-Kontsevich theorem when restricted to the top degree terms, and also the combinatorial factor of the lambda_g formula as the lowest degree terms.

Motivation & Objective

• To derive a topological recursion formula for linear Hodge integrals using polynomial generating functions.
• To show that the recursion recovers the Witten-Kontsevich theorem as the top-degree limit of the polynomial recursion.
• To demonstrate that the lowest-degree terms of the recursion reproduce the combinatorial factor of the $λ_g$ formula.
• To provide a new formulation of the cut-and-join equation via Laplace transform, simplifying combinatorial complexity.
• To unify the structure of Hodge integrals through a generating function approach grounded in topological recursion.

Proposed method

• The paper defines symmetric polynomial generating functions ${\widehat{{\mathcal{H}}}}_{g,\ell}(t_1,\dots,t_\ell)$ using recursively defined polynomials $\hat{\xi}_n(t)$ with differential operator $D = t^2(t-1)\frac{d}{dt}$.
• It applies the Laplace transform to the cut-and-join equation for Hurwitz numbers, transforming the original equation into a polynomial recursion.
• The recursion (1.2) is formulated as a topological recursion that expresses ${\widehat{{\mathcal{H}}}}_{g,\ell}$ in terms of lower-complexity generating functions.
• The method relies on comparing coefficients of monomials in the polynomial recursion to extract intersection numbers and Hodge integrals.
• The differential operator $D_i = t_i^2(t_i - 1)\frac{\partial}{\partial t_i}$ acts on generating functions to encode recursive structure.
• The recursion includes three terms: a linear term in the genus and marked points, a term from joining two surfaces, and a term from splitting the genus into two components.

Experimental results

Research questions

• RQ1 How can a topological recursion formula be constructed for linear Hodge integrals using polynomial generating functions?
• RQ2 Does the polynomial recursion recover the Witten-Kontsevich theorem as the leading-order term?
• RQ3 Can the recursion reproduce the combinatorial factor of the $\lambda_g$ formula in terms of $\langle \tau_{2g-1}\lambda_g \rangle_{g,1}$?
• RQ4 Is the Laplace transform of the cut-and-join equation equivalent to a topological recursion in the polynomial setting?
• RQ5 What is the role of the differential operator $D = t^2(t-1)\frac{d}{dt}$ in simplifying Hodge integral computations?

Key findings

• The top-degree coefficients of the polynomial recursion (1.2) reproduce the Witten-Kontsevich theorem, confirming the Virasoro constraint for $\psi$-class intersection numbers.
• The lowest-degree terms of the recursion yield the $\lambda_g$ formula, with $\langle \tau_{n_L}\lambda_g \rangle_{g,\ell} = \binom{2g-3+\ell}{n_L} \langle \tau_{2g-1}\lambda_g \rangle_{g,1}$.
• The recursion (1.2) is equivalent to the cut-and-join equation after Laplace transformation, providing a new formulation of the known Hurwitz number recursion.
• The generating function ${\widehat{{\mathcal{H}}}}_{g,\ell}$ is a symmetric polynomial of degree $3(2g-2+\ell)$, with $\hat{\xi}_n(t)$ of degree $2n+1$.
• The recursion structure mirrors topological recursion in other contexts, with contributions from genus splitting, pair joining, and marked point reduction.
• The solution to the recursion for $\lambda_g$-terms is the multinomial coefficient $\binom{2g-3+\ell}{n_1,\dots,n_\ell}$, confirming the combinatorial factor in the $\lambda_g$ formula.