A note on palindromic length of Sturmian sequences
classification
🧮 math.CO
keywords
wordinftylengthsturmianpalindromicfridfunctionthere
read the original 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 $PL_{u}$, 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 $\limsup_{n\to\infty} PL_{u}(n)=+\infty$ for any Sturmian word $u$. We show that there is a constant $K>0$ such that $PL_{u}(n)\leq K\ln n$ for every Sturmian word $u$, and that for each non-decreasing function $f$ with property $\lim_{n\to\infty}f(n)=+\infty$ there is a Sturmian word $u$ such that $PL_{u}(n)=O(f(n))$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.