On the Garden of Eden theorem for B-free subshifts
arXiv:2106.14673
Abstract
We prove that on B-free subshifts, with B satisfying the Erdös condition, all cellular automata are determined by monotone sliding block codes. In particular, this implies the validity of the Garden of Eden theorem for such systems.
arXiv comment23 pages
References in corpus (6)
- Dynamics on the graph of the torus parametrisation
- On pattern entropy of weak model sets
- A short guide to pure point diffraction in cut-and-project sets
- Number-theoretic positive entropy shifts with small centraliser and large normaliser
- Spectrum of weak model sets with Borel windows
- The Garden of Eden theorem: old and new