Palindromic length of infinite aperiodic words
Abstract
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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.