2000 character limit reached
Topological recursion for irregular spectral curves
Published 29 Dec 2014 in math.GT, math-ph, math.CO, and math.MP | (1412.8334v1)
Abstract: We study topological recursion on the irregular spectral curve $xy2-xy+1=0$, which produces a weighted count of dessins d'enfant. This analysis is then applied to topological recursion on the spectral curve $xy2=1$, which takes the place of the Airy curve $x=y2$ to describe asymptotic behaviour of enumerative problems associated to irregular spectral curves. In particular, we calculate all one-point invariants of the spectral curve $xy2=1$ via a new three-term recursion for the number of dessins d'enfant with one face.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.