Unified bijections for planar hypermaps with general cycle-length constraints

DOI10.4171/AIHPD/82zbMATH Open1439.05059arXiv1403.5371OpenAlexW3007825119MaRDI QIDQ2176599FDOQ2176599

Authors: Olivier Bernardi, Éric Fusy 

Publication date: 5 May 2020

Published in: Annales de l'Institut Henri Poincaré D. Combinatorics, Physics and their Interactions (AIHPD) (Search for Journal in Brave)

Abstract: We present a general bijective approach to planar hypermaps with two main results. First we obtain unified bijections for all classes of maps or hypermaps defined by face-degree constraints and girth constraints. To any such class we associate bijectively a class of plane trees characterized by local constraints. This unifies and greatly generalizes several bijections for maps and hypermaps. Second, we present yet another level of generalization of the bijective approach by considering classes of maps with non-uniform girth constraints. More precisely, we consider "well-charged maps", which are maps with an assignment of "charges" (real numbers) on vertices and faces, with the constraints that the length of any cycle of the map is at least equal to the sum of the charges of the vertices and faces enclosed by the cycle. We obtain a bijection between charged hypermaps and a class of plane trees characterized by local constraints.

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

Recommendations

• Unified bijections for maps with prescribed degrees and girth
• A unified bijective method for maps: application to two classes with boundaries
• Les hypercartes planaires sont des arbres très bien étiquetés. (Planar hypermaps are well-labeled trees)
• A generic method for bijections between blossoming trees and planar maps
• On the two-point function of general planar maps and hypermaps

zbMATH Keywords

generating functionsIsing modelgirthbijectionsconstellationsmobilesplanar hypermaps

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial identities, bijective combinatorics (05A19)

Cited In (6)

• Unified bijections for maps with prescribed degrees and girth
• Orientations and bijections for toroidal maps with prescribed face-degrees and essential girth
• Les hypercartes planaires sont des arbres très bien étiquetés. (Planar hypermaps are well-labeled trees)
• Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
• Enumeration of planar constellations with an alternating boundary
• Title not available (Why is that?)

This page was built for publication: Unified bijections for planar hypermaps with general cycle-length constraints

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