Avoiding abelian and additive powers in rich words
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866915153525604352 |
|---|---|
| author | Andrade, Jonathan Mol, Lucas |
| author_facet | Andrade, Jonathan Mol, Lucas |
| contents | This paper concerns the avoidability of abelian and additive powers in infinite rich words. In particular, we construct an infinite additive $5$-power-free rich word over $\{0,1\}$ and an infinite additive $4$-power-free rich word over $\{0, 1, 2\}$. The alphabet sizes are as small as possible in both cases, even for abelian powers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_15390 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Avoiding abelian and additive powers in rich words Andrade, Jonathan Mol, Lucas Combinatorics Discrete Mathematics Formal Languages and Automata Theory 68R15 This paper concerns the avoidability of abelian and additive powers in infinite rich words. In particular, we construct an infinite additive $5$-power-free rich word over $\{0,1\}$ and an infinite additive $4$-power-free rich word over $\{0, 1, 2\}$. The alphabet sizes are as small as possible in both cases, even for abelian powers. |
| title | Avoiding abelian and additive powers in rich words |
| topic | Combinatorics Discrete Mathematics Formal Languages and Automata Theory 68R15 |
| url | https://arxiv.org/abs/2408.15390 |