Prefix palindromic length of the Thue-Morse word

06/22/2019
โˆ™
by   Anna E. Frid, et al.
โˆ™
0
โˆ™

The prefix palindromic length PPL_u(n) of an infinite word u is the minimal number of palindromes to which the prefix of length n of u can be decomposed. In a 2013 paper with Puzynina and Zamboni we stated the conjecture that PPL_u(n) is unbounded for every infinite word u which is not ultimately periodic. Up to now, the conjecture has been proved only for some particular cases, including all words avoiding some power k. However, even in that case the existing upper bound for the minimal number n such that PPL_u(n)>K is greater than any constant to the power K. Precise values of PPL_u(n) are not known even for simplest examples like the Fibonacci word. In this paper, we give a first example of such a precise computation and compute the function of the prefix palindromic length of the Thue-Morse word, a famous test object for all functions on infinite words. It happens that the sequence (PPL_t(n)) is 2-regular, which raises the question if it is the case for all automatic sequences.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
โˆ™ 01/24/2022

Prefix palindromic length of the Sierpinski word

The prefix palindromic length p_๐ฎ(n) of an infinite word ๐ฎ is the minima...
research
โˆ™ 09/07/2020

On prefix palindromic length of automatic words

The prefix palindromic length PPL_๐ฎ(n) of an infinite word ๐ฎ is the mini...
research
โˆ™ 03/28/2022

Row monomial matrices and ฤŒerny conjecture, short proof

The class of row monomial matrices (one unit and rest zeros in every row...
research
โˆ™ 06/07/2018

Alignment-free sequence comparison using absent words

Sequence comparison is a prerequisite to virtually all comparative genom...
research
โˆ™ 03/26/2021

Palindromic Length and Reduction of Powers

Given a nonempty finite word v, let PL(v) be the palindromic length of v...
research
โˆ™ 09/29/2022

Enumerating Regular Languages in Constant Delay

We study the task, for a given language L, of enumerating the (generally...
research
โˆ™ 02/13/2019

Constructing Antidictionaries in Output-Sensitive Space

A word x that is absent from a word y is called minimal if all its prope...

Please sign up or login with your details

Forgot password? Click here to reset