Counting Colored Random Triangulations

Details Counting Colored Random Triangulations Counting Colored Random Triangulations

2002-06-24

arxiv.org/abs/cond-mat/0206452v1

Nucl.Phys. B641 (2002) 519-532

Physics

Condensed Matter

Statistical Mechanics

17 pages, 8 figures, tex, harvmac, epsf

Scientific paper

10.1016/S0550-3213(02)00582-5

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.

Affiliated with

Also associated with

No associations

Rating

Counting Colored Random Triangulations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting Colored Random Triangulations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting Colored Random Triangulations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-2775