On polynomials counting essentially irreducible maps

DOI10.37236/9746MaRDI QIDQ2144331zbMATH OpenOpenAlexFDO

Authors T. G. Budd

Publication date 13 June 2022

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2006.15701

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

enumeration of planar maps on genus-\(g\) surfacesplanar maps

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Moduli of Riemann surfaces, Teichmüller theory (complex-analytic aspects in several variables) (32G15)

Abstract: We consider maps on genus-$g$ surfaces with $n$ (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-$g$ curves with $n$ labeled points and is given by a symmetric polynomial $N_{g,n}(el{l}_1,ldots,el{l}_n)$ in the face degrees $2el{l}_1,ldots,2el{l}_n$. We generalize this by restricting to genus-$g$ maps that are essentially $2b$-irreducible for $bgeq0$, which loosely speaking means that they are not allowed to possess contractible cycles of length less than $2b$ and each such cycle of length $2b$ is required to bound a face of degree $2b$. The enumeration of such maps is shown to be again given by a symmetric polynomial $hat{N}_{g,n}^{(b)}(el{l}_1,ldots,el{l}_n)$ in the face degrees with a polynomial dependence on $b$. These polynomials satisfy (generalized) string and dilaton equations, which for $gleq1$ uniquely determine them. The proofs rely heavily on a substitution approach by Bouttier and Guitter and the enumeration of planar maps on genus-$g$ surfaces.

Recommendations

• Efficient enumeration of rooted maps of a given orientable genus by number of faces and vertices
• Counting rooted maps on an orientable surface of any genus by a function of the numbers of vertices and faces
• The number of degree restricted maps on general surfaces
• A note on irreducible maps with several boundaries
• Counting rooted maps on a surface

Cites work

• A bijection for essentially 3-connected toroidal maps
• A bijection for triangulations, quadrangulations, pentagulations, etc.
• A Census of Planar Triangulations
• A generic method for bijections between blossoming trees and planar maps
• A note on irreducible maps with several boundaries
• Combinatorics of Higher Derivatives of Inverses
• Counting lattice points in the moduli space of curves
• Counting surfaces. CRM Aisenstadt chair lectures
• Decision procedure for indefinite hypergeometric summation
• Higher genus correlators for the Hermitian matrix model with multiple cuts
• scientific article; zbMATH DE number 7058719 (Why is no real title available?)
• Intersection theory on the moduli space of curves and the matrix Airy function
• Invariants of algebraic curves and topological expansion
• Lagrange inversion
• Matrix model calculations beyond the spherical limit.
• On irreducible maps and slices
• On vector partition functions
• Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth
• Polynomials representing Eynard-Orantin invariants
• String and dilaton equations for counting lattice points in the moduli space of curves
• The enumeration of c-nets via quadrangulations
• The many aspects of counting lattice points in polytopes
• The partial-fractions method for counting solutions to integral linear systems
• Unified bijections for maps with prescribed degrees and girth
• Weil-Petersson volumes and cone surfaces

Cited in

(4)

• Irreducible metric maps and Weil-Petersson volumes
• On irreducible maps and slices
• Bijective enumeration of planar bipartite maps with three tight boundaries, or how to slice pairs of pants
• On quasi-polynomials counting planar tight maps

This page was built for publication: On polynomials counting essentially irreducible maps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144331)