This article was accepted into the corpus but its outbound wikilinks were never NER-processed — typical at the deepest BFS hop or when the run's entity cap was reached. No expansion funnel to show.
| Topological recursion | |
|---|---|
| Name | Topological recursion |
| Field | Mathematical physics, Algebraic geometry, Enumerative geometry |
| Introduced | 2004 |
| Creators | Bertrand Eynard, Nicolas Orantin |
| Applications | Matrix models, Gromov–Witten theory, Knot theory |
Topological recursion Topological recursion is a recursive formalism developed by Bertrand Eynard and Nicolas Orantin that produces multilinear differentials on Riemann surfaces from initial spectral data; it connects to matrix model asymptotics, intersection theory on moduli spaces, and enumerative invariants. The framework has been applied across mathematical physics and geometry, linking to results of Maxim Kontsevich, Edward Witten, and conjectures involving Alexander polynomial relations in knot theory. It has influenced computational approaches used by researchers at institutions such as the Institut des Hautes Études Scientifiques, École Normale Supérieure, and Princeton University.
Topological recursion arose to systematize expansions in random matrix model ensembles studied by Paul Wigner, Freeman Dyson, and Miguel Ángel Virasoro-related structures, offering a bridge to the intersection theory on the Deligne–Mumford compactification introduced by Pierre Deligne and David Mumford. Early demonstrations connected the formalism to the Kontsevich model solved by Maxim Kontsevich and to the Witten conjecture proven by Kontsevich and related to Virasoro algebra constraints investigated by Alexander Zamolodchikov. The approach unifies perspectives from spectral geometry in the tradition of Bernhard Riemann and asymptotic analysis developed by Harold Jeffreys and Hermann Weyl.
Given initial data typically called a spectral curve—comprising a Riemann surface with meromorphic functions and a bidifferential similar to the Bergman kernel—the recursion constructs symmetric n-point differentials W_{g,n} following residue operations around branch points identified by local involutions akin to work by Riemann and Weierstrass. The formalism uses structures appearing in the study of Abel, Jacobi, and Riemann–Roch theorem contexts and leverages bidifferential kernels related to results by Rudolf Lipschitz and Hermann Weyl. Foundational proofs and consistency conditions draw on methods from the theory of integrable hierarchies such as the Kadomtsev–Petviashvili equation, the Korteweg–de Vries equation, and links to the Ising model analyses by Ludwig Boltzmann-era developments. Constructions are often phrased using language from Algebraic geometry as practiced by Jean-Pierre Serre and Gérard Laumon and formalized in contexts similar to the work of Grothendieck and Alexander Grothendieck's school.
Classical examples include the hermitian one-matrix model originally studied by Freeman Dyson and later formalized in expansions by Miguel Ángel Virasoro's circle; its spectral curve yields W_{g,n} that reproduce Kontsevich model correlators computed by Maxim Kontsevich. Applications cover enumeration of maps in the tradition of William Tutte, computations of Hurwitz numbers studied by Adrian Hurwitz and modern treatments by André Joyal, and relations to Gromov–Witten invariants on targets considered by Alexander Givental and Dusa McDuff. In knot theory, connections trace back to the Volume conjecture proposed by Rinat Kashaev and link invariants explored by Edward Witten in Chern–Simons theory; this threads through work by Stavros Garoufalidis. Physical applications include matrix model dualities examined at CERN and conformal field theory links to constructions by Alberto Zamolodchikov and John Cardy.
Topological recursion satisfies loop equations analogous to Schwinger–Dyson relations studied by Julian Schwinger and Freeman Dyson; it yields symmetry and analytic continuation properties grounded in results of Riemann and Weierstrass. In many cases, correlators obey polynomiality and quasi-modularity phenomena connected to the theory of modular forms advanced by Bernhard Riemann and Srinivasa Ramanujan, and to arithmetic geometry pursued by Gerd Faltings. Rigorous convergence and asymptotic expansions have been established in settings influenced by techniques of Olav Kallen-style steepest-descent and the nonlinear steepest descent method of Alexander Its and Andrei Kapaev. Relations to tautological classes on moduli spaces draw on the foundational work of Carel Faber and Eduard Looijenga.
Topological recursion interfaces with integrable systems studied by Mikhail Sato and Sergio Novikov through tau-function formalisms connected to Jimbo and Miwa; it parallels developments in Donaldson–Thomas theory by Richard Thomas and Simon Donaldson and in Gromov–Witten theory by Yongbin Ruan. It connects to quantum curve ideas related to quantization programs pursued by Maxim Kontsevich and Albert Einstein-era inspiration, and to cluster algebra phenomena investigated by Fomin and Zelevinsky. Dualities echo categorical frameworks advanced by Alexander Beilinson and Joseph Bernstein and homological mirror symmetry conjectures by Maxim Kontsevich.
Implementations of recursion algorithms have been produced in software ecosystems associated with SageMath, Mathematica, and Maple by research groups at University of Cambridge and École Polytechnique. Numerical and symbolic techniques exploit residue calculations and algebraic elimination drawing on algorithms by D. Knuth and complexity results from Leslie Valiant. Packages developed in the tradition of computational algebraic geometry by David Cox and Joe Harris automate generation of W_{g,n} and verify predictions in examples motivated by string theory developments at Harvard University and Princeton University.
Active questions include classification of spectral curves producing modularity as in conjectures popularized by Don Zagier, rigorous analytic control for higher-genus spectral curves inspired by work of Kurt Strebel, and categorical interpretations linking to programs by Maxim Kontsevich and Dennis Sullivan. Further exploration targets explicit connections to quantum invariants formulated by Edward Witten and to arithmetic aspects studied by Jean-Pierre Serre and Pierre Deligne, as well as extensions toward nonperturbative completions investigated at research centers including Institut des Hautes Études Scientifiques and Perimeter Institute.