The strongly aperiodic SFT conjecture

Let GG be a finitely generated group. A strongly aperiodic subshift of finite type (SFT) is an SFT with no periodic configurations. The strongly aperiodic SFT conjecture. GG admits a strongly aperiodic SFT if and only if GG is one-ended and has decidable word problem. The general case remains widely open, although the claim is known for virtually polycyclic, solvable Baumslag–Solitar, hyperbolic, and lamplighter groups.

Sources & referencesView supporting material

Primary source

Solène J. Esnay, Ugo Giocanti and Etienne Moutot, “Period-rigidity of one-relator groups”, arXiv:2502.03602 (2025).

Additional references

3 papers in this index state this conjecture (2019–2025). The statement above is taken from the most recent of them; the others are arXiv:2406.04132, arXiv:1904.03907.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.