Automorphism groups of random substitution subshifts
Indagationes Mathematicae · 2024-09 · 35 (5) · 931-958
DOI: 10.1016/j.indag.2023.08.006 ↗Kurz gefasst
Fachartikel in der Zeitschrift Indagationes Mathematicae, 2024-09. Verfasst von Robbert Fokkink und 2 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 30 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
We prove that for a suitably nice class of random substitutions, their corresponding subshifts have automorphism groups that contain an infinite simple subgroup and a copy of the automorphism group of a full shift. Hence, they are countable, non-amenable and non-residually finite. To show this, we introduce the concept of shuffles and generalised shuffles for random substitutions, as well as a local version of recognisability for random substitutions that will be of independent interest. Without recognisability, we need a more refined notion of recognisable words in order to understand their automorphisms. We show that the existence of a single recognisable word is often enough to embed the automorphism group of a full shift in the automorphism group of the random substitution subshift.
Zitieren
APA
Fokkink, R., Rust, D., & Salo, V. (2024). Automorphism groups of random substitution subshifts. Indagationes Mathematicae, 35(5), 931-958. https://doi.org/10.1016/j.indag.2023.08.006
Vancouver
Fokkink R, Rust D, Salo V. Automorphism groups of random substitution subshifts. Indagationes Mathematicae. 2024;35(5):931-958. doi:10.1016/j.indag.2023.08.006
BibTeX
@article{Fokkink2024,
author = {Fokkink, Robbert and Rust, Dan and Salo, Ville},
title = {Automorphism groups of random substitution subshifts},
journal = {Indagationes Mathematicae},
year = {2024},
volume = {35},
number = {5},
pages = {931--958},
doi = {10.1016/j.indag.2023.08.006}
}
EUVIMED