Bijections for planar maps with boundaries

We present bijections for planar maps with boundaries. In particular, we obtain bijections for triangulations and quadrangulations of the sphere with boundaries of prescribed lengths. For triangulations we recover the beautiful factorized formula obtained by Krikun using a (technically involved) generating function approach. The analogous formula for quadrangulations is new. We also obtain a far-reaching generalization for other face-degrees. In fact, all the known enumerative formulas for maps with boundaries are proved bijectively in the present article (and several new formulas are obtained). Our method is to show that maps with boundaries can be endowed with certain "canonical" orientations, making them amenable to the master bijection approach we developed in previous articles. As an application of our enumerative formulas, we note that they provide an exact solution of the dimer model on rooted triangulations and quadrangulations.

[1]  Maxim Krikun,et al.  Explicit Enumeration of Triangulations with Multiple Boundaries , 2007, Electron. J. Comb..

[2]  Arak M. Mathai,et al.  Enumeration of almost cubic maps , 1972 .

[3]  Éric Fusy,et al.  Unified bijections for maps with prescribed degrees and girth , 2011, J. Comb. Theory, Ser. A.

[4]  M. Staudacher.  The Yang-Lee edge singularity on a dynamical planar random surface , 1990 .

[5]  R. Mullin,et al.  On Counting Rooted Triangular Maps , 1965, Canadian Journal of Mathematics.

[6]  Dominique Poulalhon,et al.  Optimal Coding and Sampling of Triangulations , 2003, Algorithmica.

[7]  Dominique Poulalhon,et al.  A Generic Method for Bijections between Blossoming Trees and Planar Maps , 2013, Electron. J. Comb..

[8]  Dominique Poulalhon,et al.  A bijection for triangulations of a polygon with interior points and multiple edges , 2003, Theor. Comput. Sci..

[9]  J. Bouttier,et al.  On Irreducible Maps and Slices , 2013, Combinatorics, Probability and Computing.

[10]  Olivier Bernardi,et al.  Unified bijections for planar hypermaps with general cycle-length constraints , 2014, Annales de l’Institut Henri Poincaré D.

[11]  Philippe Flajolet,et al.  Analytic Combinatorics , 2009 .

[12]  W. G. Brown,et al.  Enumeration of Quadrangular Dissections of the Disk , 1965, Canadian Journal of Mathematics.

[13]  Charalambos A. Charalambides,et al.  Enumerative combinatorics , 2018, SIGA.

[14]  W. T. Tutte.  A Census of Slicings , 1962, Canadian Journal of Mathematics.

[15]  P. Francesco,et al.  Geodesic distance in planar graphs , 2003, cond-mat/0303272.

[16]  W. G. Brown.  Enumeration of Triangulations of the Disk , 1964 .

[17]  J. Bouttier,et al.  Distance statistics in quadrangulations with a boundary, or with a self-avoiding loop , 2009, 0906.4892.

[18]  Éric Fusy,et al.  A bijection for triangulations, quadrangulations, pentagulations, etc , 2010, J. Comb. Theory, Ser. A.