Sturmian words and the Stern sequence
From MaRDI portal
Publication:2345447
Abstract: Central, standard, and Christoffel words are three strongly interrelated classes of binary finite words which represent a finite counterpart of characteristic Sturmian words. A natural arithmetization of the theory is obtained by representing central and Christoffel words by irreducible fractions labeling respectively two binary trees, the Raney (or Calkin-Wilf) tree and the Stern-Brocot tree. The sequence of denominators of the fractions in Raney's tree is the famous Stern diatomic numerical sequence. An interpretation of the terms of Stern's sequence as lengths of Christoffel words when is odd, and as minimal periods of central words when is even, allows one to interpret several results on Christoffel and central words in terms of Stern's sequence and, conversely, to obtain a new insight in the combinatorics of Christoffel and central words by using properties of Stern's sequence. One of our main results is a non-commutative version of the "alternating bit sets theorem" by Calkin and Wilf. We also study the length distribution of Christoffel words corresponding to nodes of equal height in the tree, obtaining some interesting bounds and inequalities.
Recommendations
- Sturmian sequences and the lexicographic world
- Sturmian words: structure, combinatorics, and their arithmetics
- Some combinatorial properties of Sturmian words
- scientific article; zbMATH DE number 1254095
- On the permutations generated by Sturmian words
- Sturmian words and words with a critical exponent
- scientific article; zbMATH DE number 1086496
- On a combinatorial property of Sturmian words
- scientific article; zbMATH DE number 1783022
- Studies on finite Sturmian words
Cites work
- scientific article; zbMATH DE number 718142 (Why is no real title available?)
- scientific article; zbMATH DE number 1736457 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- A generalized palindromization map in free monoids
- A palindromization map for the free group
- A pattern sequence approach to Stern's sequence
- A standard correspondence on epicentral words
- Certain words on the real projective line
- Christoffel words and the Calkin-Wilf tree
- Codes of central Sturmian words
- Combinatorics on Words
- Episturmian morphisms and a Galois theorem on continued fractions
- Episturmian words and some constructions of de Luca and Rauzy
- Involutions of epicentral words
- On a paper by Castelli, Mignosi, Restivo
- On an involution of Christoffel words and Sturmian morphisms
- On continued fractions and finite automata
- On graphs of central episturmian words
- Pseudopalindrome closure operators in free monoids
- Recounting the Rationals
- Some combinatorial properties of Sturmian words
- Some extremal properties of the Fibonacci word
- Stern's diatomic sequence \(0, 1, 1, 2, 1, 3, 2, 3, 1, 4, \dots \)
- Sturmian and Episturmian Words
- Sturmian words, Lyndon words and trees
- Sturmian words: structure, combinatorics, and their arithmetics
Cited in
(11)- Reversible Christoffel factorizations
- Codes of central Sturmian words
- A pattern sequence approach to Stern's sequence
- A First Investigation of Sturmian Trees
- A note on Sturmian words
- Three distance theorems and Sturmian sequences: length governing words
- On Christoffel and standard words and their derivatives
- Sturmian words and words with a critical exponent
- Studies on finite Sturmian words
- Christoffel words and the Calkin-Wilf tree
- Sturmian trees
This page was built for publication: Sturmian words and the Stern sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2345447)
