Bijective enumeration of planar bipartite maps with three tight boundaries, or how to slice pairs of pants
From MaRDI portal
Publication:6159726
Central limit and other weak theorems (60F05) Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial identities, bijective combinatorics (05A19) Enumeration in graph theory (05C30)
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.
Recommendations
Cites work
- scientific article; zbMATH DE number 54045 (Why is no real title available?)
- scientific article; zbMATH DE number 1014124 (Why is no real title available?)
- scientific article; zbMATH DE number 7058719 (Why is no real title available?)
- scientific article; zbMATH DE number 6665005 (Why is no real title available?)
- A Census of Planar Maps
- A course in metric geometry
- Classification of scaling limits of uniform quadrangulations with a boundary
- Compact Brownian surfaces. I: Brownian disks
- Confluence of geodesic paths and separating loops in large planar quadrangulations
- Constellations and multicontinued fractions: application to Eulerian triangulations
- Counting lattice points in the moduli space of curves
- Counting surfaces. CRM Aisenstadt chair lectures
- Distance statistics in quadrangulations with a boundary, or with a self-avoiding loop
- Geodesics in Brownian surfaces (Brownian maps)
- Geometry of surfaces
- Irreducible metric maps and Weil-Petersson volumes
- Isoperimetric inequalities in the Brownian plane
- Liouville quantum gravity as a metric space and a scaling limit
- On irreducible maps and slices
- On polynomials counting essentially irreducible maps
- On the enumeration of planar maps
- On the two-point function of general planar maps and hypermaps
- Optimal pants decompositions and shortest homotopic cycles on an orientable surface
- Planar maps
- Planar maps and continued fractions
- Planar maps as labeled mobiles
- Quantum Geometry
- Scaling limits of random trees and planar maps
- Tessellations of random maps of arbitrary genus
- The periodic Schur process and free fermions at finite temperature
- The three-point function of general planar maps
- The three-point function of planar quadrangulations
- Tightening nonsimple paths and cycles on surfaces
- Trees and spatial topology change in causal dynamical triangulations
- Unified bijections for maps with prescribed degrees and girth
- Uniqueness and universality of the Brownian map
Cited in
(5)- On quasi-polynomials counting planar tight maps
- Slit-slide-sew bijections for bipartite and quasibipartite plane maps
- Topological recursion for Orlov-Scherbin tau functions, and constellations with internal faces
- Topological recursion of the Weil-Petersson volumes of hyperbolic surfaces with tight boundaries
- Enumerative combinatorics. Abstracts from the workshop held December 11--17, 2022
This page was built for publication: Bijective enumeration of planar bipartite maps with three tight boundaries, or how to slice pairs of pants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6159726)
