Counting Colored Random Triangulations

Simple item page
dc.creatorBouttier, J.
dc.creatorDi Francesco, P.
dc.creatorGuitter, E.
dc.date2002-06-24
dc.date.accessioned2026-07-07T07:44:35Z
dc.date.available2026-07-07T07:44:35Z
dc.descriptionWe 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.
dc.description17 pages, 8 figures, tex, harvmac, epsf
dc.identifierhttps://arxiv.org/abs/cond-mat/0206452
dc.identifierhttp://arxiv.org/abs/cond-mat/0206452
dc.identifierNucl.Phys. B641 (2002) 519-532
dc.identifierdoi:10.1016/S0550-3213(02)00582-5
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/123250
dc.subjectStatistical Mechanics
dc.titleCounting Colored Random Triangulations
dc.typetext

Files

Collections

arXiv