Palindromic length of infinite aperiodic words
Combinatorics
2025-09-16 v2 Discrete Mathematics
Abstract
The palindromic length of the finite word is equal to the minimal number of palindromes whose concatenation is equal to . It was conjectured in 2013 that for every infinite aperiodic word , the palindromic length of its factors is not bounded. We prove this conjecture to be true.
Keywords
Cite
@article{arxiv.2410.12714,
title = {Palindromic length of infinite aperiodic words},
author = {Josef Rukavicka},
journal= {arXiv preprint arXiv:2410.12714},
year = {2025}
}