On the palindromic decomposition of binary words
arXiv:1004.1278
Abstract
We prove a precise formula for the minimal number K(n) such that every binary word of length can be divided into K(n) palindromes. Also we estimate the average number $\ol K(n)$ of palindromes composing a random binary word of the length n.
arXiv comment9 pages