Decomposition theorem on invertible substitutions (Q1282238)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Decomposition theorem on invertible substitutions
scientific article

    Statements

    Decomposition theorem on invertible substitutions (English)
    0 references
    0 references
    0 references
    16 July 1999
    0 references
    A substitution on \(\{1,2\}\) is exactly a morphism of the free group generated by \(\{1,2\}\) such that the images of 1 and 2 do not contain any symbol \(1^-\) or \(2^-\). A substitution is thus called invertible if it is furthermore an automorphism of this free group. \textit{Z. Wen} and \textit{Z. Wen} proved [C. R. Acad. Sci., Paris, Sér. I 318, No. 4, 299-304 (1994; Zbl 0812.11018)] that the monoid of invertible substitutions is generated by the following three substitutions: \[ \begin{cases} 1\to 2\\ 2\to 1\end{cases}\qquad\begin{cases} 1\to 12\\ 2\to 1\end{cases}\qquad\begin{cases} 1\to 21\\ 2\to 1\end{cases}. \] In the paper under review the authors give a new proof of this result and a geometrical characterization of the invertible substitutions. Note that two other characterizations of the invertible substitutions are known: (1) they are exactly the morphisms that send any (resp. one) Sturmian sequence to a Sturmian sequence [\textit{F. Mignosi} and \textit{P. Séébold}, J. Théor. Nombres Bordx. 5, No. 2, 221-233 (1993; Zbl 0797.11029)]; (2) they are exactly the morphisms \(\varphi\) such that \(\varphi(12)\neq\varphi(21)\) and \(z=\varphi(21121121211212)\) is balanced, i.e., for any two factors (subwords) \(u\) and \(v\) of \(z\) having the same length, the numbers of 1's in \(u\) and \(v\) are either the same or differ by 1 [\textit{J. Berstel} and \textit{P. Séébold}, Bull. Belg. Math. Soc. -- Simon Stevin 1, No. 2, 175-189 (1994; Zbl 0803.68095)].
    0 references
    balanced words
    0 references
    automorphisms
    0 references
    free groups
    0 references
    monoids of invertible substitutions
    0 references
    Sturmian sequences
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references