Combinatorical and Algebraic Structures Seminar
Session details
| Date: | 22.10.2019 |
| Speaker: | Kateřina Medková, FJFI, České vysoké učení technické v Praze |
| Title: | Non-repetitive complexity of Arnoux-Rauzy words |
| Abstract: | The non-repetitive complexity $nrC(u)$ and the initial non-repetitive complexity $inrC(u)$ are functions which reflect the structure of the infinite word $u$ with respect to the repetitions of factors of a given length. We will refer about our joint work with Edita Pelantova and Elise Vandomme. We determine $nrC(u)$ for the Arnoux–Rauzy words and $inrC(u)$ for the standard Arnoux–Rauzy words. Then we use these formulas to evaluate $nrC(u)$ and $inrC(u)$ for the $d$-bonacci word. |
Return to index.
last update: 27.9.2007, webmaster: Petr Ambrož