Fiche du document
2011
- handle: 10670/1.teqzpa
- Paquin, Geneviève et Reutenauer, Christophe (2011). « On the superimposition of Christoffel words ». Theoretical Computer Science, 412(4-5), pp. 402-418.
Ce document est lié à :
http://archipel.uqam.ca/8197/
Ce document est lié à :
http://dx.doi.org/10.1016/j.tcs
Ce document est lié à :
doi:10.1016/j.tcs.2010.10.007
Sujets proches
ConjectureCiter ce document
Geneviève Paquin et al., « On the superimposition of Christoffel words », UQAM Archipel : articles scientifiques, ID : 10670/1.teqzpa
Métriques
Partage / Export
Résumé
Initially stated in terms of Beatty sequences, the Fraenkel conjecture can be reformulated as follows: for a k-letter alphabet A, with a fixed k ≥ 3, there exists a unique balanced infinite word, up to letter permutations and shifts, that has mutually distinct letter frequencies. Motivated by the Fraenkel conjecture, we study in this paper whether two Christoffel words can be superimposed. Following from previous work on this conjecture using Beatty sequences, we give a necessary and sufficient condition for the superimposition of two Christoffel words having same length, and more generally, of two arbitrary Christoffel words. Moreover, for any two superimposable Christoffel words, we give the number of different possible superimpositions and we prove that there exists a superimposition that works for any two superimposable Christoffel words. Finally, some new properties of Christoffel words are obtained as well as a geometric proof of a classic result concerning the money problem, using Christoffel words.