On an involution of Christoffel words and Sturmian morphisms

There is a natural involution on Christoffel words, originally studied by the second author in [A. de Luca, Combinatorics of standard Sturmian words, Lecture Notes in Computer Science 1261 (1997) 249–267]. We show that it has several equivalent definitions: one of them uses the slope of the word, and changes the numerator and the denominator respectively in their inverses modulo the length; another one uses the cyclic graph allowing the construction of the word, by interpreting it in two ways (one as a permutation and its ascents and descents, coded by the two letters of the word, the other in the setting of the Fine and Wilf periodicity theorem); a third one uses central words and generation through iterated palindromic closure, by reversing the directive word. We show further that this involution extends to Sturmian morphisms, in the sense that it preserves conjugacy classes of these morphisms, which are in bijection with Christoffel words. The involution on morphisms is the restriction of some conjugation of the automorphisms of the free group. Finally, we show that, through the geometrical interpretation of substitutions of Arnoux and Ito, our involution is the same thing as duality of endomorphisms (modulo some conjugation)

Directive words of episturmian words: equivalences and normalization

Episturmian morphisms constitute a powerful tool to study episturmian words. Indeed, any episturmian word can be infinitely decomposed over the set of pure episturmian morphisms. Thus, an episturmian word can be defined by one of its morphic decompositions or, equivalently, by a certain directive word. Here we characterize pairs of words directing a common episturmian word. We also propose a way to uniquely define any episturmian word through a normalization of its directive words. As a consequence of these results, we characterize episturmian words having a unique directive word.Comment: 15 page

Quasiperiodic Sturmian words and morphisms

AbstractWe characterize all quasiperiodic Sturmian words: A Sturmian word is not quasiperiodic if and only if it is a Lyndon word. Moreover, we study links between Sturmian morphisms and quasiperiodicity

Episturmian words: a survey

In this paper, we survey the rich theory of infinite episturmian words which generalize to any finite alphabet, in a rather resembling way, the well-known family of Sturmian words on two letters. After recalling definitions and basic properties, we consider episturmian morphisms that allow for a deeper study of these words. Some properties of factors are described, including factor complexity, palindromes, fractional powers, frequencies, and return words. We also consider lexicographical properties of episturmian words, as well as their connection to the balance property, and related notions such as finite episturmian words, Arnoux-Rauzy sequences, and "episkew words" that generalize the skew words of Morse and Hedlund.Comment: 36 pages; major revision: improvements + new material + more reference

Quasiperiodic and Lyndon episturmian words

Recently the second two authors characterized quasiperiodic Sturmian words, proving that a Sturmian word is non-quasiperiodic if and only if it is an infinite Lyndon word. Here we extend this study to episturmian words (a natural generalization of Sturmian words) by describing all the quasiperiods of an episturmian word, which yields a characterization of quasiperiodic episturmian words in terms of their "directive words". Even further, we establish a complete characterization of all episturmian words that are Lyndon words. Our main results show that, unlike the Sturmian case, there is a much wider class of episturmian words that are non-quasiperiodic, besides those that are infinite Lyndon words. Our key tools are morphisms and directive words, in particular "normalized" directive words, which we introduced in an earlier paper. Also of importance is the use of "return words" to characterize quasiperiodic episturmian words, since such a method could be useful in other contexts.Comment: 33 pages; minor change

Some properties of the Tribonacci sequence

AbstractIn this paper, we consider the factor properties of the Tribonacci sequence. We define the singular words, and then give the singular factorization and the Lyndon factorization. As applications, we study the powers of the factors and the overlap of the factors. We also calculate the free index of the sequence