On the palindromic decomposition of binary words
Abstract
We prove a precise formula for the minimal number K(n) such that every binary word of length n can be divided into K(n) palindromes. Also we estimate the average number K(n) of palindromes composing a random binary word of the length n.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.