A lower bound on the density of prefixes with maximal palindromic length

Josef Rukavicka

The palindromic length $PL(u)$ of a nonempty finite word $u$ is the least number of nonempty palindromes whose concatenation is $u$. For an infinite word $w$, let $P_w(n)$ be the n…