Publication : t02/075
Counting Colored Random Triangulations
Bouttier J. (CEA, DSM, SPhT (Service de Physique Théorique), F-91191 Gif-sur-Yvette, FRANCE)Di Francesco P. (CEA, DSM, SPhT (Service de Physique Théorique), F-91191 Gif-sur-Yvette, FRANCE)
Guitter E. (CEA, DSM, SPhT (Service de Physique Théorique), F-91191 Gif-sur-Yvette, FRANCE)
Abstract:Année de publication : 2002
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.
Revue : Nucl. Phys. B 641 519-532 (2002)
DOI : 10.1016/S0550-3213(02)00582-5
Preprint : arXiv:cond-mat/0206452
Langue : Anglais
Fichier(s) à télécharger :
publi.pdf
