Enumeration of Grothendieck's dessins and KP hierarchy

preprint2014arXivOpen access

Abstract

Branched covers of the complex projective line ramified over 0,10,1 and ∞\infty (Grothendieck's {\em dessins d'enfant}) of fixed genus and degree are effectively enumerated. More precisely, branched covers of a given ramification profile over ∞\infty and given numbers of preimages of 00 and 11 are considered. The generating function for the numbers of such covers is shown to satisfy a PDE that determines it uniquely modulo a simple initial condition. Moreover, this generating function satisfies an infinite system of PDE's called the KP (Kadomtsev-Petviashvili) hierarchy. A specification of this generating function for certain values of parameters generates the numbers of {\em dessins} of given genus and degree, thus providing a fast algorithm for computing these numbers.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.