Glider Automorphisms on Some Shifts of Finite Type and a Finitary Ryan’s Theorem - Cellular Automata and Discrete Complex Systems Access content directly
Conference Papers Year : 2018

Glider Automorphisms on Some Shifts of Finite Type and a Finitary Ryan’s Theorem

Johan Kopra
  • Function : Author
  • PersonId : 1033840

Abstract

For any mixing SFT X containing a fixed point we construct a reversible shift-commuting continuous map (automorphism) which breaks any given finite point of the subshift into a finite collection of gliders traveling into opposing directions. As an application we show that the automorphism group $${{\mathrm{Aut}}}(X)$$ contains a two-element subset S whose centralizer consists only of shift maps.
Fichier principal
Vignette du fichier
469010_1_En_7_Chapter.pdf (300.11 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01824877 , version 1 (27-06-2018)

Licence

Attribution

Identifiers

Cite

Johan Kopra. Glider Automorphisms on Some Shifts of Finite Type and a Finitary Ryan’s Theorem. 24th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2018, Ghent, Belgium. pp.88-99, ⟨10.1007/978-3-319-92675-9_7⟩. ⟨hal-01824877⟩
114 View
36 Download

Altmetric

Share

Gmail Facebook X LinkedIn More