Unpublished conference/Abstract (Scientific congresses and symposiums)
About the k-binomial equivalence and the associated complexity
Lejeune, Marie
2019Ecole Jeunes Chercheurs en Informatique Mathématique
 

Files


Full Text
beamer_presentation.pdf
Author preprint (1.05 MB)
Download

All documents in ORBi are protected by a user license.

Send to



Details



Keywords :
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
Event place :
Marseille, France
Event date :
du 04 mars 2019 au 08 mars 2019
Audience :
International
Funders :
F.R.S.-FNRS - Fonds de la Recherche Scientifique [BE]
Available on ORBi :
since 11 March 2019

Statistics


Number of views
37 (12 by ULiège)
Number of downloads
17 (1 by ULiège)

Bibliography


Similar publications



Contact ORBi