Abstract
A proper -coloring of a domain in is a function assigning one of colors to each vertex of the domain such that adjacent vertices are colored differently. Sampling a proper -coloring uniformly at random, does the coloring typically exhibit long-range order? It has been known since the work of Dobrushin that no such ordering can arise when is large compared with . We prove here that long-range order does arise for each when is sufficiently high, and further characterize all periodic maximal-entropy Gibbs states for the model. Ordering is also shown to emerge in low dimensions if the lattice is replaced by with , sufficiently high and a cycle of even length. The results address questions going back to Berker--Kadanoff (1980), Kotecký (1985) and Salas--Sokal (1997).
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.