Factor maps between tiling dynamical systems
From MaRDI portal
Publication:4256540
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.
Recommendations
Cites work
Cited in
(7)- Conjugacies for tiling dynamical systems
- A primer of substitution tilings of the Euclidean plane
- A note on the definition of sliding block codes and the Curtis-Hedlund-Lyndon theorem
- Tiling deformations, cohomology, and orbit equivalence of tiling spaces
- Linearly repetitive Delone systems have a finite number of nonperiodic Delone system factors
- Introduction to hierarchical tiling dynamical systems
- Self-similar tiling systems, topological factors and stretching factors
This page was built for publication: Factor maps between tiling dynamical systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4256540)