Let be two countable amenable groups. We introduce the notion of group charts, which gives us a tool to embed an arbitrary -subshift into a -subshift. Using an entropy addition formula derived from this formalism we prove that whenever is finitely presented and admits a subshift of finite type (SFT) on which acts freely, then the set of real numbers attained as topological entropies of -SFTs is contained in the set of topological entropies of -SFTs modulo an arbitrarily small additive constant for any finitely generated group which admits a translation-like action of . In particular, we show that the set of topological entropies of -SFTs on any such group which has decidable word problem and admits a translation-like action of coincides with the set of non-negative upper semi-computable real numbers. We use this result to give a complete characterization of the entropies of SFTs in several classes of groups.
Cite this article
Sebastián Barbieri, On the entropies of subshifts of finite type on countable amenable groups. Groups Geom. Dyn. 15 (2021), no. 2, pp. 607–638DOI 10.4171/GGD/608