English

On polynomials counting essentially irreducible maps

Combinatorics 2022-05-17 v2 Mathematical Physics Algebraic Geometry math.MP

Abstract

We consider maps on genus-gg surfaces with nn (labeled) faces of prescribed even degrees. It is known since work of Norbury that, if one disallows vertices of degree one, the enumeration of such maps is related to the counting of lattice point in the moduli space of genus-gg curves with nn labeled points and is given by a symmetric polynomial Ng,n(1,,n)N_{g,n}(\ell_1,\ldots,\ell_n) in the face degrees 21,,2n2\ell_1, \ldots, 2\ell_n. We generalize this by restricting to genus-gg maps that are essentially 2b2b-irreducible for b0b\geq 0, which loosely speaking means that they are not allowed to possess contractible cycles of length less than 2b2b and each such cycle of length 2b2b is required to bound a face of degree 2b2b. The enumeration of such maps is shown to be again given by a symmetric polynomial N^g,n(b)(1,,n)\hat{N}_{g,n}^{(b)}(\ell_1,\ldots,\ell_n) in the face degrees with a polynomial dependence on bb. These polynomials satisfy (generalized) string and dilaton equations, which for g1g\leq 1 uniquely determine them. The proofs rely heavily on a substitution approach by Bouttier and Guitter and the enumeration of planar maps on genus-gg surfaces.

Keywords

Cite

@article{arxiv.2006.15701,
  title  = {On polynomials counting essentially irreducible maps},
  author = {Timothy Budd},
  journal= {arXiv preprint arXiv:2006.15701},
  year   = {2022}
}

Comments

38 pages, 5 figures. Several errors and typos have been fixed, version accepted for publication

R2 v1 2026-06-23T16:41:01.976Z