A1 Refereed original research article in a scientific journal
On palindromic factorization of words.
Authors: A Frid, S Puzynina, L Q Zamboni
Publication year: 2013
Journal: Advances in Applied Mathematics
Number in series: 5
Volume: 50
Issue: 5
First page : 737
Last page: 748
Number of pages: 12
ISSN: 0196-8858
DOI: https://doi.org/10.1016/j.aam.2013.01.002
Abstract
Given a finite word u, we define its palindromic length |u|_{pal} to be the least number n such that u=v_1v_2... v_n with each v_i a palindrome. We address the following open question: Does there exist an infinite non ultimately periodic word w and a positive integer P such that |u|_{pal}
Given a finite word u, we define its palindromic length |u|_{pal} to be the least number n such that u=v_1v_2... v_n with each v_i a palindrome. We address the following open question: Does there exist an infinite non ultimately periodic word w and a positive integer P such that |u|_{pal}
P. In particular, the result holds for all the k-power-free words and for the Sierpinski word.
UTU Research Portal