Subshifts with sparse traces
arXiv:1605.09623
Abstract
We study two-dimensional subshifts whose horizontal trace (a.k.a. projective subdynamics) contains only points of finite support. Our main result is a classification result for such subshifts satisfying a minimality property. As corollaries, we obtain new proofs for various known results on traces of SFTs, nilpotency and decidability of cellular automata, topological full groups and the subshift of prime numbers. We also construct various (sofic) examples illustrating the concepts.
arXiv comment43 pages, 9 figures. Fixed some broken definitions, elaborated on some proofs (kept the informal style). Added an example on path extraction, results otherwise unchanged. Comments welcome!
References in corpus (6)
- Simulation of Effective Subshifts by Two-dimensional Subshifts of Finite Type
- Structural aspects of tilings
- The group of reversible Turing machines
- Asymptotic behavior of dynamical systems and cellular automata
- Hierarchy and Expansiveness in Two-Dimensional Subshifts of Finite Type
- Computability of extender sets in multidimensional subshifts: asymptotic growths, dynamical constraints