A simple approach to minimal substitution subshifts (Q2415957)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A simple approach to minimal substitution subshifts
scientific article

    Statements

    A simple approach to minimal substitution subshifts (English)
    0 references
    0 references
    23 May 2019
    0 references
    \textit{G. R. Maloney} and \textit{D. Rust} [Ergodic Theory Dyn. Syst. 38, No. 3, 1086--1117 (2018; Zbl 1396.37023)] introduced the concept of ``tameness'' to simplify the study of minimal substitution subshifts. They deal with the study of one-dimensional tiling spaces arising from non-primitive rules from the point of view of the topology, dynamics and cohomology. In this paper, by using the above notions, the author studies the concept of ``\(l\)-primitivity'' for these substitutions. Then he proves that the combination of these two conditions can characterise the minimality of substitution subshifts. The author shows that there exists a concrete characterisation of minimality. Firstly, the author gives the following main theorem. Theorem. Let \(\sigma: A\rightarrow A^{+}\) be a substitution. (a) Suppose that \(\sigma\) is tame and \(l\)-primitive. Then, \((X_{\sigma}, T)\) is minimal. (b) Suppose that \((X_{\sigma}, T)\) is minimal and is not a single periodic orbit. Then, the substitution \(\sigma\) is tame, and there exists a subalphabet \(B\subseteq A\) and a restriction \(\sigma|_{B}: B\rightarrow B^{+}\) such that \(\sigma|_{B}\) is tame, \(l\)-primitive, and \((X_{\sigma}, T)= (X_{\sigma|_{B}}, T)\). Then he obtains the following theorem. Theorem. Suppose that \(\sigma: A\rightarrow A^{+}\) is a tame and \(l\)-primitive substitution, then the substitution subshift \((X_{\sigma}, T)\) is minimal.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    substitution
    0 references
    subshift
    0 references
    dynamical system
    0 references
    minimal
    0 references
    0 references