Enumeration of planar constellations with an alternating boundary

DOI10.37236/10149MaRDI QIDQ2048549zbMATH OpenOpenAlexFDO

Authors Ariane Carrance, Bouttier

Publication date 6 August 2021

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2012.14258

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

constellationsEulerian triangulationsgenerating function

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Planar graphs; geometric and topological aspects of graph theory (05C10)

Abstract: A planar hypermap with a boundary is defined as a planar map with a boundary, endowed with a proper bicoloring of the inner faces. The boundary is said alternating if the colors of the incident inner faces alternate along its contour. In this paper we consider the problem of counting planar hypermaps with an alternating boundary, according to the perimeter and to the degree distribution of innerfaces of each color. The problem is translated into a functional equation with a catalytic variable determining the corresponding generating function. In the case of constellations - hypermaps whose all inner faces of a given color have degree $mgeq2$, and whose all other inner faces have a degree multiple of $m$ - we completely solve the functional equation, and show that the generating function is algebraic and admits an explicit rational parametrization. We finally specialize to the case of Eulerian triangulations - hypermaps whose all inner faces have degree $3$ - and compute asymptotics which are needed in another work by the second author, to prove the convergence of rescaled planar Eulerian triangulations to the Brownian map.

Review text

Summary: A planar hypermap with a boundary is defined as a planar map with a boundary, endowed with a proper bicoloring of the inner faces. The boundary is said alternating if the colors of the incident inner faces alternate along its contour. In this paper we consider the problem of counting planar hypermaps with an alternating boundary, according to the perimeter and to the degree distribution of inner faces of each color. The problem is translated into a functional equation with a catalytic variable determining the corresponding generating function. In the case of constellations -- hypermaps whose all inner faces of a given color have degree \(m\geqslant 2\), and whose all other inner faces have a degree multiple of \(m\) -- we completely solve the functional equation, and show that the generating function is algebraic and admits an explicit rational parametrization. We finally specialize to the case of Eulerian triangulations -- hypermaps whose all inner faces have degree \(3\) -- and compute asymptotics which are needed in another work by the second author, to prove the convergence of rescaled planar Eulerian triangulations to the Brownian map.

Recommendations

• Enumeration of planar constellations
• scientific article; zbMATH DE number 3871396
• Asymptotic enumeration of constellations and related families of maps on orientable surfaces
• scientific article; zbMATH DE number 1009718
• A simple formula for the series of constellations and quasi-constellations with boundaries
• scientific article; zbMATH DE number 4101214
• Enumerating pseudo-triangulations in the plane
• Enumeration of articulation pairs of a planar graph
• Enumeration of planar two-face maps
• Counting planar diagrams with various restrictions

Cites work

• Analytic combinatorics
• Blocked edges on Eulerian maps and mobiles: application to spanning trees, hard particles and the Ising model
• Constellations and multicontinued fractions: application to Eulerian triangulations
• Counting surfaces. CRM Aisenstadt chair lectures
• Critical Ising model on random triangulations of the disk: enumeration and local limits
• Enumeration of planar constellations
• Graphs on surfaces and their applications. Appendix by Don B. Zagier
• Growth and percolation on the uniform infinite planar triangulation
• scientific article; zbMATH DE number 88818 (Why is no real title available?)
• Local convergence of large random triangulations coupled with an Ising model
• On the enumeration of planar maps
• On the two-point function of general planar maps and hypermaps
• Planar maps
• Planar maps as labeled mobiles
• Polynomial equations with one catalytic variable, algebraic series and map enumeration
• The kernel method: a collection of examples
• Unified bijections for planar hypermaps with general cycle-length constraints
• Uniform random colored complexes
• Walks on the slit plane

Cited in

(4)

• Constellations and multicontinued fractions: application to Eulerian triangulations
• A generalization of the quadrangulation relation to constellations and hypermaps
• Topological recursion for Orlov-Scherbin tau functions, and constellations with internal faces
• The slice decomposition of planar hypermaps

This page was built for publication: Enumeration of planar constellations with an alternating boundary

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2048549)