Building large free subshifts using the Local Lemma (Q2286357): Difference between revisions

Summary: \textit{S. Gao} et al. [Math. Proc. Camb. Philos. Soc. 147, No. 3, 579--592 (2009; Zbl 1217.03031)] proved that every countably infinite group \(\Gamma\) admits a nonempty free subshift \(X \subseteq 2^\Gamma \). Here we strengthen this result by showing that free subshifts can be ``large'' in various senses. Specifically, we prove that for any \(k \geqslant 2\) and \(h < \log_2 k\), there exists a free subshift \(X \subseteq k^\Gamma\) of Hausdorff dimension and, if \(\Gamma\) is sofic, entropy at least \(h\), answering two questions attributed by \textit{S. Gao} et al. [Group colorings and Bernoulli subflows. Providence, RI: American Mathematical Society (AMS) (2016; Zbl 1375.37036); Problems 11.2.4 and 11.2.5] to Juan Souto. Furthermore, we establish a general lower bound on the largest ``size'' of a free subshift \(X'\) contained inside a given subshift \(X\). A central role in our arguments is played the Lovász Local Lemma, an important tool in probabilistic combinatorics, whose relevance to the problem of finding free subshifts was first recognized by \textit{N. Aubrun} et al. [Groups Geom. Dyn. 13, No. 1, 107--129 (2019; Zbl 1437.37014)].