Invertible substitutions on a three-letter alphabet.
type: Item
instance of: scholarly article
title: Invertible substitutions on a three-letter alphabet.
zbMATH Open document ID: 1042.11017
DOI: 10.1016/S1631-073X(02)00006-7
author: Bo Tan
author: Zhixiong Wen
author: Yiping Zhang
published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris
publication date: 2004-02-19T00:00:00Z
review text: A substitution is defined as a non-erasing morphism of the free monoid; a substitution is called invertible if it extends to an automorphism of the free group. The structure of the monoid of invertible substitutions over a two-letter alphabet is perfectly known [\textit{Z. Wen} and \textit{Z. Wen}, C. R. Acad. Sci., Paris, Sér. I 318, 299--304 (1994; Zbl 0812.11018)]; moreover it coincides with the monoid of Sturmian substitutions, that is, the substitutions which fix Sturmian words [\textit{F. Mignosi} and \textit{P Séébold}, J. Théor. Nombres Bordx. 5, 221--233 (1993; Zbl 0797.11029)]. The aim of this note is to extend this result to three-letter alphabets. The situation is a priori more involved since the monoid of invertible substitutions over a three-letter alphabet is known to be of infinite type [\textit{Z. Wen} and \textit{Y. Zhang}, Chin. Sci. Bull. 44, 1755--1760 (1999; Zbl 1040.20504)]. Nevertheless it is proved in the note under review that there exists a finite set S of elementary substitutions such that any invertible substitution can be decomposed as a finite composition of these susbtitutions, up to an inner automorphism; more precisely, if \(\sigma\) is an invertible substitution over a three-letter alphabet, then there exist \(W\), \(k\) such that \(\sigma= I_W\circ\sigma_i\circ \cdots\circ \sigma_k\), where for all \(i\), \(\sigma_i\in S\) and \(I_W\) is the morphism of the free group defined by \(I_W: U\mapsto WUW^{-1}\) (it is not a substitution in general). This immediately implies that an integer square matrix of size 3 with non-negative entries is the incidence matrix of an invertible substitution if and only if it is a finite product of nonnegative elementary matrices.
Mathematics Subject Classification ID: 11B85
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 37B10
zbMATH DE Number: 1907779
zbMATH Keywords: substitutions
zbMATH Keywords: Fibonacci morphism
zbMATH Keywords: automorphism of the free group
reviewed by: Valérie Berthé
MaRDI profile type: Publication
cites work: Pisot substitutions and Rauzy fractals
cites work: Q5486010
cites work: Uniform tag sequences
cites work: Decomposition theorem on invertible substitutions
cites work: Q4529547
cites work: Q4145882
cites work: Q4135772
cites work: Polynomials associated with endomorphisms of free groups
cites work: Fibonacci morphisms and Sturmian words
cites work: Q4296127
cites work: Some properties of the singular words of the Fibonacci word
cites work: Invertible substitutions and local isomorphisms
cites work: Some remarks on invertible substitutions on three letter alphabet.
Recommended article: The structure of invertible substitutions on a three-letter alphabet
Recommended article: Invertible substitutions and Sturmian sequences.
Recommended article: Some properties of invertible substitutions of rank \(d\), and higher dimensional substitutions.
Recommended article: Fractal representation of the attractive lamination of an automorphism of the free group.
Recommended article: Some properties of substitutive words
Recommended article: Sturm numbers and substitution invariance of 3iet words
Recommended article: Decomposition theorem on invertible substitutions
Recommended article: Some remarks on invertible substitutions on three letter alphabet.
Recommended article: Words and morphisms with Sturmian erasures
description: scientific article; zbMATH DE number 1907779