Coloring Random Triangulations
arXiv:cond-mat/9711050 · doi:10.1016/S0550-3213(98)00037-6
Abstract
We introduce and solve a two-matrix model for the tri-coloring problem of the vertices of a random triangulation. We present three different solutions: (i) by orthogonal polynomial techniques (ii) by use of a discrete Hirota bilinear equation (iii) by direct expansion. The model is found to lie in the universality class of pure two-dimensional quantum gravity, despite the non-polynomiality of its potential.
50 pages, 4 figures, Tex, uses harvmac, epsf
References in corpus (1)
Cited by in corpus (17)
- Critical behavior of colored tensor models in the large N limit
- Colored Tensor Models - a Review
- A generalization of the Virasoro algebra to arbitrary dimensions
- Census of Planar Maps: From the One-Matrix Model Solution to a Combinatorial Proof
- Rectangular Matrix Models and Combinatorics of Colored Graphs
- Relaxation in graph coloring and satisfiability problems
- Critical and Tricritical Hard Objects on Bicolorable Random Lattices: Exact Solutions
- Statistics of planar graphs viewed from a vertex: A study via labeled trees
- Rotational Symmetry Breaking in Multi-Matrix Models
- Geometrically constrained statistical systems on regular and random lattices: From folding to meanders
- Counting Colored Random Triangulations
- Fully Packed O(n=1) Model on Random Eulerian Triangulations
- Hamiltonian Cycles on a Random Three-coordinate Lattice
- Hamiltonian Cycles on Random Eulerian Triangulations
- Folding the Square-Diagonal Lattice
- Exactly solvable flat-foldable quadrilateral origami tilings
- One-matrix differential reformulation of two-matrix models