Palindromic length of infinite aperiodic words
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915492980064256 |
|---|---|
| author | Rukavicka, Josef |
| author_facet | Rukavicka, Josef |
| contents | The palindromic length of the finite word $v$ is equal to the minimal number of palindromes whose concatenation is equal to $v$. It was conjectured in 2013 that for every infinite aperiodic word $x$, the palindromic length of its factors is not bounded. We prove this conjecture to be true. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_12714 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Palindromic length of infinite aperiodic words Rukavicka, Josef Combinatorics Discrete Mathematics 68R15 The palindromic length of the finite word $v$ is equal to the minimal number of palindromes whose concatenation is equal to $v$. It was conjectured in 2013 that for every infinite aperiodic word $x$, the palindromic length of its factors is not bounded. We prove this conjecture to be true. |
| title | Palindromic length of infinite aperiodic words |
| topic | Combinatorics Discrete Mathematics 68R15 |
| url | https://arxiv.org/abs/2410.12714 |