Factor maps between tiling dynamical systems
Dynamical Systems
2007-05-23 v2 Probability
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.
Cite
@article{arxiv.math/9806096,
title = {Factor maps between tiling dynamical systems},
author = {Karl Petersen},
journal= {arXiv preprint arXiv:math/9806096},
year = {2007}
}
Comments
8 pages