Factor maps between tiling dynamical systems

From MaRDI portal
Publication:4256540

DOI10.1515/FORM.1999.011zbMATH Open0930.54031arXivmath/9806096OpenAlexW2962814352MaRDI QIDQ4256540FDOQ4256540


Authors: Karl Petersen Edit this on Wikidata


Publication date: 19 July 1999

Published in: Forum Mathematicum (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/math/9806096




Recommendations




Cites Work


Cited In (6)





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)