Bijective enumeration of planar bipartite maps with three tight boundaries, or how to slice pairs of pants
arXiv:2104.10084 · doi:10.5802/ahl.143
Abstract
We consider planar maps with three boundaries, colloquially called pairs of pants. In the case of bipartite maps with controlled face degrees, a simple expression for their generating function was found by Eynard and proved bijectively by Collet and Fusy. In this paper, we obtain an even simpler formula for \emph{tight} pairs of pants, namely for maps whose boundaries have minimal length in their homotopy class. We follow a bijective approach based on the slice decomposition, which we extend by introducing new fundamental building blocks called bigeodesic triangles and diangles, and by working on the universal cover of the triply punctured sphere. We also discuss the statistics of the lengths of minimal separating loops in (non necessarily tight) pairs of pants and annuli, and their asymptotics in the large volume limit.
arXiv comment76 pages, 29 figures, final version
References in corpus (14)
- 2D Gravity and Random Matrices
- Uniqueness and universality of the Brownian map
- Scaling limits of random trees and planar maps
- The three-point function of planar quadrangulations
- Distance statistics in quadrangulations with a boundary, or with a self-avoiding loop
- Trees and spatial topology change in CDT
- Planar maps and continued fractions
- On irreducible maps and slices
- Geodesics in Brownian surfaces (Brownian maps)
- Confluence of geodesic paths and separating loops in large planar quadrangulations
- The three-point function of general planar maps
- Planar maps and random partitions
- On the two-point function of general planar maps and hypermaps
- Compact Brownian surfaces II. Orientable surfaces