Counting Colored Random Triangulations

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
17 pages, 8 figures, tex, harvmac, epsf

Keywords

Statistical Mechanics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/123250

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cond-mat/0206452
 http://arxiv.org/abs/cond-mat/0206452
 Nucl.Phys. B641 (2002) 519-532
 doi:10.1016/S0550-3213(02)00582-5

Collections

arXiv