English

A note on palindromic length of Sturmian sequences

Combinatorics 2018-08-28 v1

Abstract

Frid, Puzynina and Zamboni (2013) defined the palindromic length of a finite word ww as the minimal number of palindromes whose concatenation is equal to ww. For an infinite word uu we study PLuPL_{u}, that is, the function that assigns to each positive integer nn, the maximal palindromic length of factors of length nn in uu. Recently, Frid (2018) proved that lim supnPLu(n)=+\limsup_{n\to\infty} PL_{u}(n)=+\infty for any Sturmian word uu. We show that there is a constant K>0K>0 such that PLu(n)KlnnPL_{u}(n)\leq K\ln n for every Sturmian word uu, and that for each non-decreasing function ff with property limnf(n)=+\lim_{n\to\infty}f(n)=+\infty there is a Sturmian word uu such that PLu(n)=O(f(n))PL_{u}(n)=O(f(n)).

Keywords

Cite

@article{arxiv.1808.08879,
  title  = {A note on palindromic length of Sturmian sequences},
  author = {Petr Ambrož and Edita Pelantová},
  journal= {arXiv preprint arXiv:1808.08879},
  year   = {2018}
}