Perfectly Clustering Words and Iterated Palindromes over a Ternary Alphabet
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_ | 1866916298779262976 |
|---|---|
| author | Lapointe, Mélodie Plourde-Hébert, Nathan |
| author_facet | Lapointe, Mélodie Plourde-Hébert, Nathan |
| contents | Recently, a new characterization of Lyndon words that are also perfectly clustering was proposed by Lapointe and Reutenauer (2024). A word over a ternary alphabet {a,b,c} is called perfectly clustering Lyndon if and only if it is the product of two palindromes and it can be written as apbqc where p and q are palindromes. We study the properties of palindromes appearing as factors p and q and their links with iterated palindromes over a ternary alphabet.
|
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2406_16410 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Perfectly Clustering Words and Iterated Palindromes over a Ternary Alphabet Lapointe, Mélodie Plourde-Hébert, Nathan Combinatorics Recently, a new characterization of Lyndon words that are also perfectly clustering was proposed by Lapointe and Reutenauer (2024). A word over a ternary alphabet {a,b,c} is called perfectly clustering Lyndon if and only if it is the product of two palindromes and it can be written as apbqc where p and q are palindromes. We study the properties of palindromes appearing as factors p and q and their links with iterated palindromes over a ternary alphabet. |
| title | Perfectly Clustering Words and Iterated Palindromes over a Ternary Alphabet |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2406.16410 |