Counting colored random triangulations

DOI10.1016/S0550-3213(02)00582-5MaRDI QIDQ699557zbMATH OpenOpenAlexFDO

Authors Bouttier, Philippe Di Francesco, Emmanuel Guitter

Publication date 24 September 2002

Published in Nuclear Physics B (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cond-mat/0206452

zbMATH Keywords

decorated tree enumerationplanar graph counting

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Enumeration in graph theory (05C30) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)

Abstract: We revisit the problem of enumeration of vertex-tricolored planar random triangulations solved in [Nucl. Phys. B 516 [FS] (1998) 543-587] in the light of recent combinatorial developments relating classical planar graph counting problems to the enumeration of decorated trees. We give a direct combinatorial derivation of the associated counting function, involving tricolored trees. This is generalized to arbitrary k-gonal tessellations with cyclic colorings and checked by use of matrix models.

Recommendations

• Coloring random triangulations
• Counting colored planar maps: algebraicity results
• Counting planar maps, coloured or uncoloured
• Counting coloured planar maps: differential equations
• Rectangular matrix models and combinatorics of colored graphs

Cites work

• A Census of Planar Maps
• Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees
• Coloring random triangulations
• Enumeration of planar constellations
• Planar diagrams

Cited in

(18)

• Counting gluings of octahedra
• Counting patterns in colored orthogonal arrays
• Rectangular matrix models and combinatorics of colored graphs
• Injectively \(k\)-colored rooted forests
• On the number of planar Eulerian orientations
• Geodesic distance in planar graphs: an integrable approach
• Counting colored planar maps: algebraicity results
• Geodesic distance in planar graphs
• Statistics of planar graphs viewed from a vertex: A study via labeled trees
• Census of planar maps: From the one-matrix model solution to a combinatorial proof
• Critical behavior of colored tensor models in the large \(N\) limit
• Coloring random triangulations
• Orthogonal matrix Laurent polynomials
• Symmetries of unlabelled planar triangulations
• Colored triangulations of arbitrary dimensions are stuffed Walsh maps
• Chromatic statistics for triangulations and Fuß-Catalan complexes
• A generalization of the Virasoro algebra to arbitrary dimensions
• Multicritical continuous random trees

This page was built for publication: Counting colored random triangulations

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