Combinatorical and Algebraic Structures Seminar
Session details
| Date: | 12.11.2019 |
| Speaker: | Olga Parshina, FJFI, České vysoké učení technické v Praze |
| Title: | On closed and open factors in Arnoux-Rauzy words |
| Abstract: | A finite word $v$ is called closed if it is a complete first return to some proper factor $u$ meaning that $v$ has exactly two occurrences of $u$, one as a prefix and one as a suffix. The word which is not closed is called open. By convention, the empty word and any letter are closed. We are interested in studying functions that count the number of open and closed factors of each length in a given infinite word. The main result to present is explicit formulae for the functions counting the number of closed and open factors in the class of infinite words that encompass Sturmian words and is called Arnoux-Rauzy words. |
Return to index.
last update: 27.9.2007, webmaster: Petr Ambrož