An iterative solution of the three-colour problem on a random lattice
From MaRDI portal
Abstract: We study the generalisation of Baxter's three-colour problem to a random lattice. Rephrasing the problem as a matrix model problem we discuss the analyticity structure and the critical behaviour of the resulting matrix model. Based on a set of loop equations we develop an algorithm which enables us to solve the three-colour problem recursively
Recommendations
Cites work
- Construction of non-critical string field theory by transfer matrix formalism in dynamical triangulation
- Hermitian matrix model with plaquette interaction
- scientific article; zbMATH DE number 3473200 (Why is no real title available?)
- Phase structure of the \(O(n)\) model on a random lattice for \(n> 2\)
- Planar diagrams
- The two-point function of \(c=-2\) matter coupled to 2D quantum gravity
- Vertex models on Feynman diagrams
Cited in
(12)- Coloring random triangulations
- Hamiltonian cycles on a random three-coordinate lattice
- Hamiltonian cycles on random Eulerian triangulations
- D-particles, matrix integrals and KP hierarchy.
- Exact solution of the three-color problem on a random lattice
- A renormalization group approach to a Yang-Mills two matrix model
- Formal Matrix Integrals and Combinatorics of Maps
- Folding and coloring problems in mathematics and physics
- Remarks on the eigenvalues distributions of \(D\leq 4\) Yang-Mills matrix models
- Exact meander asymptotics: a numerical check
- Bootstrapping the critical behavior of multi-matrix models
- Three-coloring statistical model with domain wall boundary conditions: trigonometric limit
This page was built for publication: An iterative solution of the three-colour problem on a random lattice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382365)