Palindromic length of infinite aperiodic words
arXiv:2410.12714 · doi:10.1016/j.ejc.2025.104237
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.