Factor maps between tiling dynamical systems

Simple item page
dc.creatorPetersen, Karl
dc.date1998-06-18
dc.date1998-07-03
dc.date.accessioned2026-07-07T05:25:05Z
dc.date.available2026-07-07T05:25:05Z
dc.descriptionWe 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.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/math/9806096
dc.identifierhttp://arxiv.org/abs/math/9806096
dc.identifierForum Mathematicum 11 (1999), 503-512.
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/77055
dc.subjectDynamical Systems
dc.subjectProbability
dc.titleFactor maps between tiling dynamical systems
dc.typetext

Files

Collections

arXiv