Embedding Bratteli-Vershik systems in cellular automata

Pivato, Marcus and Yassawi, Reem (2010). Embedding Bratteli-Vershik systems in cellular automata. Ergodic Theory and Dynamical Systems, 30(5) pp. 1561–1572.

DOI: https://doi.org/10.1017/S0143385709000601

Abstract

Many dynamical systems can be naturally represented as Bratteli–Vershik (or adic) systems, which provide an appealing combinatorial description of their dynamics. If an adic system X is linearly recurrent, then we show how to represent X using a two-dimensional subshift of finite type Y; each ‘row’ in a Y-admissible configuration corresponds to an infinite path in the Bratteli diagram of X, and the vertical shift on Y corresponds to the ‘successor’ map of X. Any Y-admissible configuration can then be recoded as the space-time diagram of a one-dimensional cellular automaton Φ; in this way X is embedded in Φ (i.e. X is conjugate to a subsystem of Φ). With this technique, we can embed many odometers, Toeplitz systems, and constant-length substitution systems in one-dimensional cellular automata.

Viewing alternatives

Download history

Metrics

Public Attention

Altmetrics from Altmetric

Number of Citations

Citations from Dimensions

Item Actions

Export

About

Recommendations