Realization of aperiodic subshifts and uniform densities in groups (Q1733162): Difference between revisions

A theorem of \textit{S. Gao} et al. [Math. Proc. Camb. Philos. Soc. 147, No. 3, 579--592 (2009; Zbl 1217.03031)] originally conjectured to be false by \textit{E. Glasner} and \textit{V. V. Uspenskij} [Proc. Am. Math. Soc. 137, No. 9, 3147--3154 (2009; Zbl 1222.54038)] asserts that every countable group admits a \(2\)-coloring. A direct consequence of this result is that every countable group has a strongly aperiodic subshift on the alphabet \(\{0,1\}\). In this paper the authors use Lovász local lemma first to give a new simple proof of the mentioned theorem, and then to prove the existence of a \(G\)-effectively closed strongly aperiodic subshift for any finitely generated group \(G\). They also study the problem of constructing subshifts which generalize a property of classical Sturmian sequences to finitely generated groups (see [\textit{M. Lothaire}, Combinatorics on words. Reading, MA: Addison-Wesley Publishing Co., Advanced Book Program/World Science Division. (1983; Zbl 0514.20045)], and bibliography therein). More precisely, a subshift over the alphabet \(\{0,1\}\) has uniform density \(\alpha \in [0,1]\) if for every configuration the density of \(1\)'s in any increasing sequence of balls converges to \(\alpha\). The authors show a slightly more general result which implies that these subshifts always exist in the case of groups of subexponential growth.