Some combinatorial properties of Sturmian words
Theoretical Computer Science
Sturmian words, Lyndon words and trees
Theoretical Computer Science
Sturmian words: structure, combinatorics, and their arithmetics
Theoretical Computer Science - Special issue: formal language theory
On the conjugation of standard morphisms
MFCS '96 Selected papers from the 21st symposium on Mathematical foundations of computer science
Fine and Wilf's theorem for three periods and a generalization of Sturmian words
Theoretical Computer Science
Concrete Math
Combinatories of Standard Sturmian Words
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Burrows--Wheeler transform and Sturmian words
Information Processing Letters
Invertible substitutions and Sturmian sequences
European Journal of Combinatorics
Harmonic and gold Sturmian words
European Journal of Combinatorics
European Journal of Combinatorics
A palindromization map for the free group
Theoretical Computer Science
On a generalization of Christoffel words: epichristoffel words
Theoretical Computer Science
Circular sturmian words and Hopcroft's algorithm
Theoretical Computer Science
On graphs of central episturmian words
Theoretical Computer Science
Involutions of epicentral words
European Journal of Combinatorics
Sturmian and episturmian words: a survey of some recent results
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
On the superimposition of Christoffel words
Theoretical Computer Science
An extension of Christoffel duality to a subset of Sturm numbers and their characteristic words
Theoretical Computer Science
An arithmetic and combinatorial approach to three-dimensional discrete lines
DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery
On a class of locally symmetric sequences: the right infinite word Λθ
MCM'11 Proceedings of the Third international conference on Mathematics and computation in music
Selfdual substitutions in dimension one
European Journal of Combinatorics
A standard correspondence on epicentral words
European Journal of Combinatorics
Hi-index | 0.01 |
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).