Author:
Alon Noga,Briceño Raimundo,Chandgotia Nishant,Magazinov Alexander,Spinka Yinon
Abstract
AbstractWe study and classify proper q-colourings of the ℤd lattice, identifying three regimes where different combinatorial behaviour holds. (1) When
$q\le d+1$
, there exist frozen colourings, that is, proper q-colourings of ℤd which cannot be modified on any finite subset. (2) We prove a strong list-colouring property which implies that, when
$q\ge d+2$
, any proper q-colouring of the boundary of a box of side length
$n \ge d+2$
can be extended to a proper q-colouring of the entire box. (3) When
$q\geq 2d+1$
, the latter holds for any
$n \ge 1$
. Consequently, we classify the space of proper q-colourings of the ℤd lattice by their mixing properties.
Publisher
Cambridge University Press (CUP)
Subject
Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献