Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-24T16:56:03.061Z Has data issue: false hasContentIssue false
  • English
  • Français

Embedding Bratteli–Vershik systems in cellular automata

Published online by Cambridge University Press:  15 October 2009

MARCUS PIVATO  and
REEM YASSAWI
MARCUS PIVATO
Affiliation:
Department of Mathematics, Trent University, 1600 West Bank Drive, Peterborough, Ontario, K9J 7B8, Canada (email: [email protected], [email protected])
REEM YASSAWI
Affiliation:
Department of Mathematics, Trent University, 1600 West Bank Drive, Peterborough, Ontario, K9J 7B8, Canada (email: [email protected], [email protected])
Get access Rights & Permissions [Opens in a new window]

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.

Type
Research Article
Information
Ergodic Theory and Dynamical Systems , Volume 30 , Issue 5 , October 2010 , pp. 1561 - 1572
Copyright
Copyright © Cambridge University Press 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[1]Cortez, M. I., Durand, F., Host, B. and Maass, A.. Continuous and measurable eigenfunctions of linearly recurrent dynamical Cantor systems. J. London Math. Soc. 67(3) (2003), 790–804.Google Scholar
[2]Coven, E. M., Pivato, M. and Yassawi, R.. Prevalence of odometers in cellular automata. Proc. Amer. Math. Soc. 135(3) (2007), 815–821 (electronic).Google Scholar
[3]Coven, E. and Yassawi, R.. Embedding odometers in cellular automata. Fund. Math. to appear. Preprint, 2007.Google Scholar
[4]Downarowicz, T.. Survey of odometers and Toeplitz flows. Algebraic and Topological Dynamics (Contemporary Mathematics, 385). American Mathematical Society, Providence, RI, 2005,pp. 7–37.CrossRefGoogle Scholar
[5]Durand, F.. Ergod. Th. & Dynam. Sys., 23(2) (2003), 663–669, Corrigendum and addendum to: ‘Linearly recurrent subshifts have a finite number of non-periodic subshift factors’ [Ergod. Th. & Dynam. Sys., 20(4) (2000), 1061–1078].CrossRefGoogle Scholar
[6]Durand, F., Host, B. and Skau, C.. Substitutional dynamical systems, Bratteli diagrams and dimension groups. Ergod. Th. & Dynam. Sys. 19(4) (1999), 953–993.CrossRefGoogle Scholar
[7]Fogg, N. P.. Substitutions in Dynamics, Arithmetics and Combinatorics (Lecture Notes in Mathematics, 1794). Eds. Berthé, V., Ferenczi, S., Mauduit, C. and Siegel, A.. Springer, Berlin, 2002.CrossRefGoogle Scholar
[8]Forrest, A. H.. K-groups associated with substitution minimal systems. Israel J. Math. 98 (1997), 101–139.CrossRefGoogle Scholar
[9]Gjerde, R. and Johansen, Ø.. Bratteli–Vershik models for Cantor minimal systems: applications to Toeplitz flows. Ergod. Th. & Dynam. Sys. 20(6) (2000), 1687–1710.CrossRefGoogle Scholar
[10]Geller, W. and Misiurewicz, M.. Irrational life. Experiment. Math. 14(3) (2005), 271–275.CrossRefGoogle Scholar
[11]Hedlund, G. A.. Endormorphisms and automorphisms of the shift dynamical system. Math. Systems Theory 3 (1969), 320–375.CrossRefGoogle Scholar
[12]Herman, R. H., Putnam, I. F. and Skau, C. F.. Ordered Bratteli diagrams, dimension groups and topological dynamics. Internat. J. Math. 3(6) (1992), 827–864.Google Scholar
[13]Kellendonk, J.. Noncommutative geometry of tilings and gap labelling. Rev. Math. Phys. 7(7) (1995), 1133–1180.Google Scholar
[14]Kůrka, P.. Topological and Symbolic Dynamics (Cours Spécialisés [Specialized Courses], 11). Société Mathématique de France, Paris, 2003.Google Scholar
[15]Milnor, J.. On the entropy geometry of cellular automata. Complex Systems 2(3) (1988), 357–385.Google Scholar