On the two-point function of general planar maps and hypermaps
Jérémie Bouttier, Éric Fusy, Emmanuel Guitter
Source abstract
We consider the problem of computing the distance-dependent two-point function of general planar maps and hypermaps, i.e. the problem of counting such maps with two marked points at a prescribed distance. The maps considered here may have faces of arbitrarily large degree, which requires new bijections to be tackled. We obtain exact expressions for the following cases: general and bipartite maps counted by their number of edges, 3-hypermaps and 3-constellations counted by their number of dark faces, and finally general and bipartite maps counted by both their number of edges and their number of faces.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.