Translation-like Actions and Aperiodic Subshifts on Groups
arXiv:1508.06419
Abstract
It is well known that if admits a f.g. subgroup with a weaklyaperiodic SFT (resp. an undecidable domino problem), then itself has a weakly aperiodic SFT (resp. an undecidable domino problem).We prove that we can replace the property " is a subgroup of "by " acts translation-like on ", provided is finitely presented.In particular:* If and are f.g. infinite groups, then has a weakly aperiodic SFT (and actually a undecidable domino problem). In particular the Grigorchuk group has an undecidable domino problem. * Every infinite f.g. -group admits a weakly aperiodic SFT.
References in corpus (1)
Cited by in corpus (5)
- A generalization of the simulation theorem for semidirect products
- On the entropies of subshifts of finite type on countable amenable groups
- Translation-like actions yield regular maps
- A counterexample to the easy direction of the geometric Gersten conjecture
- The domino problem is undecidable on surface groups