Computing automorphism groups of shifts using atypical equivalence classes
From MaRDI portal
Publication:2826232
Abstract: We study the automorphism group of an infinite minimal shift such that the complexity difference function, , is bounded. We give some new bounds on and also study the one-sided case. For a class of Toeplitz shifts, including the class of shifts defined by constant length primitive substitutions with a coincidence and with height one, we show that the two-sided automorphism group is a cyclic group. We next focus on shifts generated by primitive constant length substitutions. For these shifts, we give an algorithm that computes their two-sided automorphism group, As a corollary we describe how to compute the set of conjugacies between two such shifts.
Recommendations
Cites work
- scientific article; zbMATH DE number 4140089 (Why is no real title available?)
- scientific article; zbMATH DE number 3431597 (Why is no real title available?)
- scientific article; zbMATH DE number 5051582 (Why is no real title available?)
- scientific article; zbMATH DE number 2236657 (Why is no real title available?)
- A short proof of a theorem of Cobham on substitutions
- A topological invariant of substitution minimal sets
- Asymptotic orbits of primitive substitutions
- Block maps between primitive uniform and Pisot substitutions
- Endomorphisms of Sturmian systems and the discrete chair substitution tiling system
- Endomorphisms of substitution minimal sets
- Every compact metric space that supports a positively expansive homeomorphism is finite
- Homomorphismes entre systèmes dynamiques définis par substitutions
- Linearly recurrent subshifts have a finite number of non-periodic subshift factors
- On automorphism groups of low complexity subshifts
- Power of words and recognizability of fixpoints of a substitution
- Substitution Minimal Flows
- Substitutional dynamical systems, Bratteli diagrams and dimension groups
- The automorphism group of a shift of linear growth: beyond transitivity
- The spectrum of dynamical systems arising from substitutions of constant length
- Topological conjugacy of constant length substitution dynamical systems
- Topological conjugacy to given constant length substitution minimal systems
- Valeurs propres des systèmes dynamiques définis par des substitutions de longueur variable
Cited in
(19)- The mapping class group of a shift of finite type
- Universal groups of cellular automata
- Topological conjugacy of constant length substitution dynamical systems
- Spectral structures and topological methods in mathematical quasicrystals. Abstracts from the workshop held October 1--7, 2017
- The automorphism group of a minimal shift of stretched exponential growth
- Complete regularity of Ellis semigroups of \(\mathbb{Z}\)-actions
- Extended symmetry groups of multidimensional subshifts with hierarchical structure
- Characteristic measures of symbolic dynamical systems
- Large normalizers of \(\mathbb{Z}^d\)-odometer systems and realization on substitutive subshifts
- Algebraic invariants for group actions on the Cantor set
- Realization of big centralizers of minimal aperiodic actions on the Cantor set
- Monochromatic arithmetic progressions in automatic sequences with group structure
- Toeplitz subshift whose automorphism group is not finitely generated
- Semicocycle discontinuities for substitutions and reverse-reading automata
- Reversing and extended symmetries of shift spaces
- On automorphism groups of Toeplitz subshifts
- Admissible reversing and extended symmetries for bijective substitutions
- Number-theoretic positive entropy shifts with small centralizer and large normalizer
- Automorphisms of automatic shifts
This page was built for publication: Computing automorphism groups of shifts using atypical equivalence classes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2826232)