Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Aperiodic Subshifts of Finite Type on Groups

Emmanuel Jeandel 1, *
* Corresponding author
1 CARTE - Theoretical adverse computations, and safety
LORIA - FM - Department of Formal Methods , Inria Nancy - Grand Est
Abstract : In this note we prove the following results: • If a finitely presented group G admits a strongly aperiodic SFT, then G has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists a computable obstruction for them to admit strongly aperiodic SFTs. • On the positive side, we build strongly aperiodic SFTs on some new classes of groups. We show in particular that some particular monster groups admits strongly aperiodic SFTs for trivial reasons. Then, for a large class of group G, we show how to build strongly aperiodic SFTs over Z × G. In particular, this is true for the free group with 2 generators, Thompson's groups T and V , P SL2(Z) and any f.g. group of rational matrices which is bounded.
Complete list of metadata
Contributor : Emmanuel Jeandel Connect in order to contact the contributor
Submitted on : Friday, July 3, 2015 - 11:04:28 AM
Last modification on : Saturday, October 16, 2021 - 11:26:05 AM
Long-term archiving on: : Tuesday, April 25, 2017 - 10:34:11 PM


Files produced by the author(s)


  • HAL Id : hal-01110211, version 2
  • ARXIV : 1501.06831



Emmanuel Jeandel. Aperiodic Subshifts of Finite Type on Groups. 2015. ⟨hal-01110211v2⟩



Record views


Files downloads