Second order balance property on Christoffel words - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2020

Second order balance property on Christoffel words

Lama Tarsissi
Laurent Vuillon
  • Fonction : Auteur
  • PersonId : 841767

Résumé

In this paper we study the balance matrix that gives the order of balance of any binary word. In addition, we define for Christoffel words a new matrix called second order balance matrix. This matrix gives more information on the balance property of a word that codes the number of occurrences of the letter 1 in successive blocks of the same length for the studied Christoffel word. By taking the maximum of the Second order balance matrix we define the second order of balance and we are able to order the Christoffel words according to these values. Our construction uses extensively the continued fraction associated with the slope of each Christoffel word, and we prove a recursive formula based on fine properties of the Stern-Brocot tree to construct second order matrices. Finally, we show that an infinite path on the Stern-Brocot tree, which minimizes the second order of balance is given by a path associated with the Fibonacci word.
Fichier principal
Vignette du fichier
Second-order-balance-property-on-Christoffel-words.pdf (433.34 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-02433984 , version 1 (09-01-2020)
hal-02433984 , version 2 (26-08-2021)

Identifiants

Citer

Lama Tarsissi, Laurent Vuillon. Second order balance property on Christoffel words. Daniel Slamanig; Elias Tsigaridas; Zafeirakis Zafeirakopoulos. Mathematical Aspects of Computer and Information Sciences. 8th International Conference, MACIS 2019, Gebze, Turkey, November 13–15, 2019, Revised Selected Papers, 11989, Springer, pp.295-312, 2020, Lecture Notes in Computer Science, 978-3-030-43119-8. ⟨10.1007/978-3-030-43120-4_23⟩. ⟨hal-02433984v2⟩
93 Consultations
111 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More