2002/06/24 by J. Bouttier, P. Di Francesco, E. Guitter · 2 citations
Mathematics · Physics and Astronomy · #Markov Chains and Monte Carlo Methods #Random Matrices and Applications #Stochastic processes and statistical mechanics #cond-mat.stat-mech
paper · pdf · doi:10.1016/s0550-3213(02)00582-5
published as Nucl.Phys. B641 (2002) 519-532 · 17 pages, 8 figures, tex, harvmac, epsf
arxiv created 2002/06/24 · openalex publication_date 2002/10/01 · arxiv updated 2009/11/30 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
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.