combinatorics on words; binomial coefficients; k-binomial equivalence; k-binomial complexity; Thue-Morse word; Tribonacci word
Abstract :
[en] In these slides, we present the notions of k-binomial equivalence, and k-binomial complexity. For an arbitrary infinite word w, this function maps every non-negative integer n to the number of length-n factors in w. We then study the values of this function on several well-known infinite words. We finally discuss more deeply the notion of k-binomial equivalence and we rise some interesting open questions.
Disciplines :
Mathematics
Author, co-author :
Lejeune, Marie ; Université de Liège - ULiège > Département de mathématique > Mathématiques discrètes
Language :
English
Title :
About the k-binomial equivalence and the associated complexity
Alternative titles :
[fr] Au sujet de l'équivalence k-binomiale et de la fonction de complexité associée
Publication date :
07 March 2019
Event name :
Ecole Jeunes Chercheurs en Informatique Mathématique
