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.

翻译：有限单词 $v$ 的回文长度等于其可分解为回文串的最小数目。2013年有猜想提出：对于任意无限非周期单词 $x$，其因子的回文长度均无上界。本文证明了该猜想成立。