Fully Packed O(n=1) Model on Random Eulerian Triangulations

Abstract

We introduce a matrix model describing the fully-packed O(n) model on random Eulerian triangulations (i.e. triangulations with all vertices of even valency). For n=1 the model is mapped onto a particular gravitational 6-vertex model with central charge c=1, hence displaying the expected shift c -> c+1 when going from ordinary random triangulations to Eulerian ones. The case of arbitrary n is also discussed.

12 pages, 3 figures, tex, harvmac, epsf

References in corpus (5)

• An Iterative Solution of the Three-colour Problem on a Random Lattice
• Coloring Random Triangulations
• SU(N) Meander Determinants
• Hamiltonian Cycles on a Random Three-coordinate Lattice
• Counting Hamiltonian cycles on planar random lattices

Cited by in corpus (12)

• Meanders: Exact Asymptotics
• Critical and Tricritical Hard Objects on Bicolorable Random Lattices: Exact Solutions
• Rotational Symmetry Breaking in Multi-Matrix Models
• Geometrically constrained statistical systems on regular and random lattices: From folding to meanders
• Exact Meander Asymptotics: a Numerical Check
• Boundary changing operators in the O(n) matrix model
• The asymmetric ABAB matrix model
• Critical behaviour of loop models on causal triangulations
• Exponents for Hamiltonian paths on random bicubic maps and KPZ
• A matrix model for strings beyond the c=1 barrier: the spin-s Heisenberg model on random surfaces
• Geometrically Constrained Statistical Models on Fixed and Random Lattices: From Hard Squares to Meanders
• Loop Model with Generalized Fugacity in Three Dimensions