paper

Virasoro constraints and topological recursion for Grothendieck's dessin counting

arXiv:1406.5976 · doi:10.1007/s11005-015-0771-0

Abstract

We compute the number of coverings of with a given monodromy type over 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.

22 pages, 4 figures; extended version

Cited by in corpus (35)