Skip to main content

On Irreducible Maps and Slices

  • J. BOUTTIER (a1) (a2) and E. GUITTER (a1)

We consider the problem of enumerating d-irreducible maps, i.e., planar maps all of whose cycles have length at least d, and such that any cycle of length d is the boundary of a face of degree d. We develop two approaches in parallel: the natural approach via substitution, where these maps are obtained from general maps by a replacement of all d-cycles by elementary faces, and a bijective approach via slice decomposition, which consists in cutting the maps along shortest paths. Both lead to explicit expressions for the generating functions of d-irreducible maps with controlled face degrees, summarized in some elegant ‘pointing formula’. We provide an equivalent description of d-irreducible slices in terms of so-called d-oriented trees. We finally show that irreducible maps give rise to a hierarchy of discrete integrable equations which include equations encountered previously in the context of naturally embedded trees.

Hide All
[1]Akemann, G., Baik, J. and Di Francesco, P., eds (2011) The Oxford Handbook of Random Matrix Theory, Oxford University Press.
[2]Albenque, M. and Bouttier, J. (2012) Constellations and multicontinued fractions: Application to Eulerian triangulations. In 24th International Conference on Formal Power Series and Algebraic Combinatorics: FPSAC 2012, DMTCS proc. AR 805–816.
[3]Albenque, M., Fusy, É. and Poulalhon, D. (2014) On symmetric quadrangulations and triangulations. European J. Combin. 35 1331.
[4]Albenque, M. and Poulalhon, D. (2013) Generic method for bijections between blossoming trees and planar maps. arXiv:1305.1312
[5]Banderier, C., Flajolet, P., Schaeffer, G. and Soria, M. (2001) Random maps, coalescing saddles, singularity analysis, and Airy phenomena. Random Struct. Alg. 19 194246.
[6]Bernardi, O. and Fusy, É. (2012) A bijection for triangulations, quadrangulations, pentangulations, etc. J. Combin. Theory Ser. A 119 218244.
[7]Bernardi, O. and Fusy, É. (2012) Unified bijections for maps with prescribed degrees and girth. J. Combin. Theory Ser. A 119 13511387.
[8]Bousquet-Mélou, M. (2006) Limit laws for embedded trees: Applications to the integrated super-Brownian excursion. Random Struct. Alg. 29 475523.
[9]Bouttier, J., Di Francesco, P. and Guitter, E. (2003) Geodesic distance in planar graphs. Nucl. Phys. B663 [FS] 535567.
[10]Bouttier, J. and Guitter, E. (2009) Distance statistics in quadrangulations with a boundary, or with a self-avoiding loop. J. Phys. A 42 465–208.
[11]Bouttier, J. and Guitter, E. (2010) Distance statistics in quadrangulations with no multiple edges and the geometry of minbus. J. Phys. A 43 205207.
[12]Bouttier, J. and Guitter, E. (2012) Planar maps and continued fractions. Commun. Math. Phys. 309 623662.
[13]Bouttier, J. and Guitter, E.A note on irreducible maps with several boundaries. Electron. J. Combin. 21 #P1.23.
[14]Brown, W. G. (1965) Enumeration of quadrangular dissections of the disk. Canad. J. Math. 17 302317.
[15]Collet, G. and Fusy, É. (2012) . In 24th International Conference on Formal Power Series and Algebraic Combinatorics: FPSAC 2012, DMTCS proc. AR 607–618.
[16]Comtet, L. (1974) Advanced Combinatorics: The Art of Finite and Infinite Expansions, Springer.
[17]Di Francesco, P. (2005) Geodesic distance in planar graphs: An integrable approach. Ramanujan J. 10 153186.
[18]Di Francesco, P. and Guitter, E. (2005) Integrability of graph combinatorics via random walks and heaps of dimers. J. Statist. Mech. P09001.
[19]Flajolet, P. (1980) Combinatorial aspects of continued fractions. Discrete Math. 32 125161. Reprinted in the 35th Special Anniversary Issue of Discrete Math. 306 (10/11) 992–1021 (2006).
[20]Flajolet, P. and Sedgewick, R. (2009) Analytic Combinatorics, Cambridge University Press.
[21]Fusy, É. (2009) Transversal structures on triangulations: A combinatorial study and straight-line drawings. Discrete Math. 309 18701894.
[22]Fusy, É. (2010) New bijective links on planar maps via orientations. European J. Combin. 31 145160.
[23]Fusy, É., Poulalhon, D. and Schaeffer, G. (2008) Dissections, orientations, and trees, with applications to optimal mesh encoding and to random sampling. Trans. Algorithms 4 #19.
[24]Goulden, I. P. and Jackson, D. M. (1983) Combinatorial Enumeration, Wiley. Republished by Dover (2004).
[25]Goulden, I. P. and Jackson, D. M. (2008) The KP hierarchy, branched covers, and triangulations. Adv. Math. 219 932951.
[26]Kuba, M. (2011) A note on naturally embedded ternary trees. Electron J. Combin. 18 #142.
[27]Le Gall, J.-F. (2013) Uniqueness and universality of the Brownian map. Ann. Probab. 41 28802960.
[28]Mullin, R. and Schellenberg, P. (1968) The enumeration of c-nets via quadrangulations. J. Combin. Theory 4 259276.
[29]Schaeffer, G. (1998) Conjugaison d'arbres et cartes combinatoires aléatoires. PhD Thesis, Université Bordeaux I.
[30]Tutte, W. T. (1962) A census of planar triangulations. Canad. J. Math. 14 2138.
[31]Tutte, W. T. (1962) A census of Hamiltonian polygons. Canad. J. Math. 14 402417.
[32]Tutte, W. T. (1962) A census of slicings. Canad. J. Math. 14 708722.
[33]Tutte, W. T. (1963) A census of planar maps. Canad. J. Math. 15 249271.
[34]Viennot, X. G. (1984) Une théorie combinatoire des polynômes orthogonaux. Lecture Notes UQAM, publication du LACIM, Université du Québec à Montréal, revised (1991).
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Combinatorics, Probability and Computing
  • ISSN: 0963-5483
  • EISSN: 1469-2163
  • URL: /core/journals/combinatorics-probability-and-computing
Please enter your name
Please enter a valid email address
Who would you like to send this to? *



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed