On polynomials counting essentially irreducible maps
Timothy Budd

TL;DR
This paper generalizes the enumeration of maps on genus-$g$ surfaces by introducing a class of essentially $2b$-irreducible maps, deriving symmetric polynomial formulas, and establishing string and dilaton equations for their counts.
Contribution
It extends known map enumeration results to a broader class of essentially $2b$-irreducible maps with polynomial dependence on $b$ and derives related recursive equations.
Findings
Enumeration given by symmetric polynomials in face degrees
Polynomials satisfy generalized string and dilaton equations
Results hold for genus $g \\leq 1$ with unique determination
Abstract
We consider maps on genus- surfaces with (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- curves with labeled points and is given by a symmetric polynomial in the face degrees . We generalize this by restricting to genus- maps that are essentially -irreducible for , which loosely speaking means that they are not allowed to possess contractible cycles of length less than and each such cycle of length is required to bound a face of degree . The enumeration of such maps is shown to be again given by a symmetric polynomial in the face degrees with a polynomial dependence…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Stochastic processes and statistical mechanics · Advanced Combinatorial Mathematics
