Frid's logarithmic palindromic-length conjecture for power-free words

Let ww be an infinite word, and let PPLw(n)\operatorname{PPL}_w(n) denote the palindromic length of the prefix of ww of length nn. Frid's conjecture. If ww is kk-power-free for some positive integer kk, then

lim supnPPLw(n)lnn>0.\limsup_{n\rightarrow\infty}\frac{\operatorname{PPL}_w(n)}{\ln n}>0.

This predicts logarithmic growth, along an infinite subsequence of prefix lengths, for the palindromic length of prefixes of every power-free infinite word.

Sources & referencesView supporting material

Primary source

Josef Rukavicka, “Palindromic Length and Reduction of Powers”, arXiv:2103.14609 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.