Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quasi-polynomiality of monotone orbifold Hurwitz numbers and Grothendieck's dessins d'enfants

Published 26 Oct 2016 in math.CO, math-ph, math.AG, and math.MP | (1610.08376v2)

Abstract: We prove quasi-polynomiality for monotone and strictly monotone orbifold Hurwitz numbers. The second enumerative problem is also known as enumeration of a special kind of Grothendieck's dessins d'enfants or $r$-hypermaps. These statements answer positively two conjectures proposed by Do-Karev and Do-Manescu. We also apply the same method to the usual orbifold Hurwitz numbers and obtain a new proof of the quasi-polynomiality in this case. In the second part of the paper we show that the property of quasi-polynomiality is equivalent in all these three cases to the property that the $n$-point generating function has a natural representation on the $n$-th cartesian powers of a certain algebraic curve. These representations are the necessary conditions for the Chekhov-Eynard-Orantin topological recursion.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.