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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
