Factor maps between tiling dynamical systems
Karl Petersen
Abstract
We show that there is no Curtis-Hedlund-Lyndon Theorem for factor maps between tiling dynamical systems: there are codes between such systems which cannot be achieved by working within a finite window. By considering 1-dimensional tiling systems, which are the same as flows under functions on subshifts with finite alphabets of symbols, we construct a `simple' code which is not `local', a local code which is not simple, and a continuous code which is neither local nor simple.
Create a lesson
Related papers
Profinite approach to S-adic shift spaces II: Invertible directive sequences
Jorge Almeida, Alfredo Costa, Herman Goulet-Ouellet
Star-shaped periodic solutions of a system of delay differential equations: A computer-assisted proof
Shoya Motonaga, Akitoshi Takayasu
Ergodic full measures and entropy spectrum for countable observables on compact spaces
Carllos Eduardo Holanda
Limit cycles of singular algebraic foliations on the real projective plane
Tianwei Gan, Hongjin He, Dongmei Xiao
Quadratic Hubbard trees, automata, and ray connections
Eduardo Ventilari Sodré
Algorithmic Non-dimensionalisation of Polynomial Dynamical Systems with CRNNondim
Georgio Hawi, Martin Wechselberger