Abstract
The Eynard-Orantin recursion formula provides an effective tool for certain enumeration problems in geometry. The formula requires a spectral curve and the recursion kernel. We present a uniform construction of the spectral curve and the recursion kernel from the unstable geometries of the original counting problem. We examine this construction using four concrete examples: Grothendieck's dessins d'enfants (or higher-genus analogue of the Catalan numbers), the intersection numbers of tautological cotangent classes on the moduli stack of stable pointed curves, single Hurwitz numbers, and the stationary Gromov-Witten invariants of the complex projective line.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.