2 papers
math.GR2026
Self-simulability of graph products
Kanéda Blot, Ville Salo
A group is self-simulable if all its computable actions admit SFT covers, which means roughly that they can be implemented with finitely many tiling constraints. We prove that a gr…
math.GR2025
A geometric obstruction to self-simulation for groups
Sebastián Barbieri, Sebastián Barbieri, Kanéda Blot +3
We introduce a new quasi-isometry invariant for finitely generated groups and show that every group with this property admits a subshift which is effectively closed by patterns and…