Prevalence of Odometers in Cellular Automata

dc.creatorCoven, Ethan M.
dc.creatorPivato, Marcus
dc.creatorYassawi, Reem
dc.creator.
dc.date2005-11-01
dc.date.accessioned2026-07-07T06:50:37Z
dc.date.available2026-07-07T06:50:37Z
dc.descriptionWe consider a left permutive cellular automaton Phi, with no memory and positive anticipation, defined on the space of all doubly infinite sequences with entries from a finite alphabet. For each such automaton that is not one-to-one, there is a dense set of points X (which is large in another sense too) such that the Phi-orbit closure of each x in X is topologically conjugate to an odometer (the ``+1'' map on a projective limit of finite cyclic groups). We identify this odometer in several cases.
dc.description8 pages
dc.identifierhttps://arxiv.org/abs/math/0511030
dc.identifierhttp://arxiv.org/abs/math/0511030
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/104721
dc.subjectDynamical Systems
dc.subject37B15 (primary); 68Q80 (secondary)
dc.titlePrevalence of Odometers in Cellular Automata
dc.typetext

Files

Collections