Metraipolis › archive › dc_84e8d3e009bd

Enumeration of plane hypermaps with a mixed boundary II — arXiv:2611.01148

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.01148
License (as archived)
CC0-1.0
Archived
2026-11-03T18:49:39.032Z
SHA-256 of the archived text
25561cc32b285ae7025b528c082c2a0b09a4f82def76fb8ce115e2900ef5f479
Stable URL of this page
https://metraipolis.com/documento/dc_84e8d3e009bd

How to cite

Enumeration of plane hypermaps with a mixed boundary II — arXiv:2611.01148 — arXiv (en), https://arxiv.org/abs/2611.01148 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_84e8d3e009bd (Metraipolis archive dc_84e8d3e009bd, sha256 25561cc32b285ae7025b528c082c2a0b09a4f82def76fb8ce115e2900ef5f479)
BibTeX
@misc{dc84e8d3e009bd,
  title = {Enumeration of plane hypermaps with a mixed boundary II — arXiv:2611.01148},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.01148},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_84e8d3e009bd; sha256 25561cc32b285ae7025b528c082c2a0b09a4f82def76fb8ce115e2900ef5f479},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01148. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A plane hypermap with a boundary is a connected graph embedded in the plane with a distinguished face, and whose inner faces are properly face-bicolored. We say that such hypermaps are k-alternating if the colors of the faces adjacent to the distinguished face alternate at most 2k times when going counterclockwise. Eynard and Orantin, in [EO2005], have found a universal expression for the generating functions of k-alternating hypermaps as a surprisingly simple function of the generating function of 1-alternating hypermaps. In this article, we will provide combinatorial formulas for k-alternating hypermaps using specific subclasses of hypermaps in which each vertex can either be connected to a previously marked vertex, called accessible, or connected to all other vertices in what we call a blob. In particular, this method will allow us to derive the results from [EO2005] from a combinatorial perspective, and we anticipate that it will lead to the computation of asymptotics for hypermaps in future work. This article is naturally a sequel to, and most importantly a generalization of, the results in [BEL26], which deals essentially with the case of 1- and 2-alternating hypermaps.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.01148 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T18:15:38.063Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).