Virasoro constraints and topological recursion for Grothendieck's dessin counting
classification
🧮 math.CO
keywords
constraintsgiveninftynumbersrecursiontopologicalvirasorocompute
read the original abstract
We compute the number of coverings of ${\mathbb{C}}P^1\setminus\{0, 1, \infty\}$ with a given monodromy type over $\infty$ and given numbers of preimages of 0 and 1. We show that the generating function for these numbers enjoys several remarkable integrability properties: it obeys the Virasoro constraints, an evolution equation, the KP (Kadomtsev-Petviashvili) hierarchy and satisfies a topological recursion in the sense of Eynard-Orantin.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.