The strong topological Rokhlin property and Medvedev degrees of SFTs
By: Nicanor Carrasco-Vargas
Potential Business Impact:
Finds groups that can't be understood by computers.
We prove that if a recursively presented group admits a (nonempty) subshift of finite type with nonzero Medvedev degree then it fails to have the strong topological Rokhlin property. This result simplifies a known criterion and provides new examples of recursively presented groups without this property.
Similar Papers
A Three-Dimensional SFT with Sparse Columns
Dynamical Systems
Makes computer patterns predictable in 3 directions.
Parametrized complexity of relations between multidimensional subshifts
Dynamical Systems
Helps understand complex patterns in data.
Period-rigidity of one-relator groups
Group Theory
Groups can't repeat patterns, proving a math guess.