
TL;DR
This paper explores how identifying algebraic curves, or spectral curves, can solve enumeration problems in geometry and combinatorics, revealing polynomial structures and connections to quantum geometric quantization.
Contribution
It demonstrates the role of spectral curves in solving enumeration problems, providing new proofs and insights, and discusses the open problem of finding the spectral curve for Apéry sequences.
Findings
Polynomiality of Hurwitz number generating functions.
Short proofs of Witten-Kontsevich and Faber-Pandharipande theorems.
Connection between spectral curves and quantization in geometric contexts.
Abstract
It has been noticed since around 2007 that certain enumeration problems can be solved when an analytic or algebraic curve is identified. This curve is the key to the problem. In these lectures, a few such examples are presented. One is a detailed account on counting simple Hurwitz numbers, explaining how the problem was solved by discovering this key curve. The formula for the curve allows us to write the generating functions of Hurwitz numbers in terms of polynomials. This unexpected polynomiality produces, as a byproduct, straightforward and short proofs of the Witten-Kontsevich theorem and the -theorem of Faber-Pandharipande. An analogous enumeration problem associated with Catalan numbers is also presented, which has a simpler feature in terms of analysis. The asymptotic behavior of counting leads this time to the Euler characteristic of the moduli spaces of smooth…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Theories and Applications · Analytic Number Theory Research · Advanced Mathematical Identities
