Virasoro约束与Grothendieck dessin计数拓扑递归
Virasoro constraints and topological recursion for Grothendieck's dessin counting
摘要：
我们计算的覆盖数的${\mathbb{C}}P^1\setminus\{0, 1, \infty\}$与给定的monodromy类型在$\infty$和给定的数量的0和1的原像。我们证明了这些数的生成函数具有几个显著的可积性：它服从Virasoro约束，一个发展方程，KP（Kadomtsev-Petviashvili）族，并且满足Eynard-Orantin意义下的拓扑递归.
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
