A bijection for covered maps, or a shortcut between Harer-Zagier's and Jackson's formulas
Journal of Combinatorial Theory Series A
Enumerating simplicial decompositions of surfaces with boundaries
European Journal of Combinatorics
| Hi-index | 0.00 |
The enumeration of maps and the study of uniform random maps have been classical topics of combinatorics and statistical physics ever since the seminal work of Tutte in the 1960s. Following the bijective approach initiated by Cori and Vauquelin in the '80s, we describe a bijection between rooted maps, or rooted bipartite quadrangulations, on a surface of genus $g$ and some simpler objects that generalize plane trees. Thanks to a rerooting argument, our bijection allows us to compute the generating series of rooted maps on a surface of genus $g$ with respect to the number of edges, and to recover the asymptotic numbers of such maps. Our construction allows us to keep track in a bipartite quadrangulation of the distances of all vertices to a random basepoint. This is an analogue for higher genus surfaces of the basic result on which were built the recent advances in the comprehension of the intrinsic geometry of large random planar maps, hopefully opening the way to the study of a model of continuum random surfaces of genus $g$.