A note on palindromic length of Sturmian sequences
Abstract
Frid, Puzynina and Zamboni (2013) defined the palindromic length of a finite word w as the minimal number of palindromes whose concatenation is equal to w. For an infinite word u we study PLu, that is, the function that assigns to each positive integer n, the maximal palindromic length of factors of length n in u. Recently, Frid (2018) proved that n∞ PLu(n)=+∞ for any Sturmian word u. We show that there is a constant K>0 such that PLu(n)≤ K n for every Sturmian word u, and that for each non-decreasing function f with property n∞f(n)=+∞ there is a Sturmian word u such that PLu(n)=O(f(n)).
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.