Enumeration of hypermaps of a given genus
From MaRDI portal
Publication:4615064
DOI10.26493/1855-3974.1115.90FzbMATH Open1404.05084arXiv1510.09019OpenAlexW2963660342WikidataQ129389734 ScholiaQ129389734MaRDI QIDQ4615064FDOQ4615064
Authors: Alain Giorgetti, Timothy R. S. Walsh 
Publication date: 1 February 2019
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Abstract: This paper addresses the enumeration of rooted and unrooted hypermaps of a given genus. For rooted hypermaps the enumeration method consists of considering the more general family of multirooted hypermaps, in which darts other than the root dart are distinguished. We give functional equations for the generating series counting multirooted hypermaps of a given genus by number of darts, vertices, edges, faces and the degrees of the vertices containing the distinguished darts. We solve these equations to get parametric expressions of the generating functions of rooted hypermaps of low genus. We also count unrooted hypermaps of given genus by number of darts, vertices, hyperedges and faces.
Full work available at URL: https://arxiv.org/abs/1510.09019
Recommendations
Cites Work
- Analytic combinatorics
- Title not available (Why is that?)
- Graphs on surfaces and their applications. Appendix by Don B. Zagier
- Virasoro constraints and topological recursion for Grothendieck's dessin counting
- Theory of Maps on Orientable Surfaces
- Quantum contextual finite geometries from dessins d'enfants
- A Census of Slicings
- The number of rooted maps on an orientable surface
- Simple recurrence formulas to count maps on orientable surfaces
- Enumeration of unrooted maps of a given genus
- Counting rooted maps by genus. I
- Generating functions of bipartite maps on orientable surfaces
- A Multivariate Arithmetic Function of Combinatorial and Topological Significance
- Hypermaps versus bipartite maps
- Combinatorics of loop equations for branched covers of sphere
- Relations fonctionnelles et dénombrement des cartes pointées sur le tore. (Functional relations and the enumeration of rooted genus one maps)
- Efficient enumeration of rooted maps of a given orientable genus by number of faces and vertices
- Formal Matrix Integrals and Combinatorics of Maps
- Enumeration of unrooted orientable maps of arbitrary genus by number of edges and vertices
- Hypercartes pointées sur le tore: Décompositions et dénombrements. (Rooted genus one hypermaps on the torus: Decompositions and enumerations)
- Recent progress in enumeration of hypermaps
- Counting hypermaps by Egorychev's method
- Title not available (Why is that?)
- Space-efficient generation of nonisomorphic maps and hypermaps
Cited In (10)
- Recent progress in enumeration of hypermaps
- On the enumeration of hypermaps which are self-equivalent with respect to reversing the colors of vertices
- Rationality in map and hypermap enumeration by genus
- Enumeration of unrooted hypermaps
- Explicit formulas for a family of hypermaps beyond the one-face case
- Infinitely many hypermaps of a given type and genus
- Enumeration of unrooted hypermaps of a given genus
- Counting hypermaps by Egorychev's method
- Title not available (Why is that?)
- Hypercartes pointées sur le tore: Décompositions et dénombrements. (Rooted genus one hypermaps on the torus: Decompositions and enumerations)
This page was built for publication: Enumeration of hypermaps of a given genus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4615064)
