An Iterative Solution of the Three-colour Problem on a Random Lattice
B. Eynard, C. Kristjansen
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
Create a lesson
Related papers
Developing the Statistical Mechanics of Evolving Assembly Spaces
Anisha K. Yeddanapudi, Abhishek Sharma, Ian Seet et al.
Ergodicity breaking transition beyond qubits
Tanay Pathak, Abhik Kumar Saha
Extended-range percolation on lattices with cubic and non-compact neighborhoods in three dimensions
Zhe Zhang, Yuxuan Fan, Yang Yang et al.
Competitive scaling of small-subsystem-optimization heuristics for LABS
Ginger E. Lau, Adil A. Gangat
IceCube data for astrophysical neutrinos exhibit q-statistical behavior
Constantino Tsallis, Ugur Tirnakli
Robust Golden Ratio universality as a consequence of a circulant symmetry
Luka Paljk, Johannes Schmidt, Vladislav Popkov