Mixing properties of colorings of the lattice
arXiv:1903.11685
Abstract
We study and classify proper -colorings of the lattice, identifying three regimes where different combinatorial behavior holds: (1) When , there exist frozen colorings, that is, proper -colorings of which cannot be modified on any finite subset. (2) We prove a strong list-coloring property which implies that, when , any proper -coloring of the boundary of a box of side length can be extended to a proper -coloring of the entire box. (3) When , the latter holds for any . Consequently, we classify the space of proper -colorings of the lattice by their mixing properties.
Minor revisions, 14 pages, 2 figures