Enumerating planar stuffed maps as hypertrees of mobiles
Enumerating planar stuffed maps as hypertrees of mobiles
A planar stuffed map is an embedding of a graph into the 2-sphere $S^{2}$, considered up to orientation-preserving homeomorphisms, such that the complement of the graph is a collection of disjoint topologically connected components that are each homeomorphic to $S^{2}$ with multiple boundaries. This is a generalization of planar maps whose complement of the graph is a collection of disjoint topologically connected components that are each homeomorphic to a disc. In this work, we construct a bijection between certain bipartite planar stuffed maps and collections of integer-labelled trees connected by hyperedges such that they form a hypertree, called hypermobiles. This bijection directly generalizes the Bouttier-Di Franceso-Guitter bijection between bipartite planar maps and mobiles. We show that the generating functions of these trees of mobiles satisfy both an algebraic equation, generalizing the case of ordinary planar maps, and a new functional equation. As an example, we explicitly enumerate a class of stuffed quadrangulations.
Nathan Pagliaroli
数学
Nathan Pagliaroli.Enumerating planar stuffed maps as hypertrees of mobiles[EB/OL].(2025-06-06)[2025-07-16].https://arxiv.org/abs/2506.06086.点此复制
评论