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 as the minimal number of palindromes whose concatenation is equal to . For an infinite word we study , that is, the function that assigns to each positive integer , the maximal palindromic length of factors of length in . Recently, Frid (2018) proved that for any Sturmian word . We show that there is a constant such that for every Sturmian word , and that for each non-decreasing function with property there is a Sturmian word such that .
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}
}