4 problems

Frid's conjecture. The palindromic length sequence of an infinite word is bounded if and only if the infinite word is ultimately periodic.

Let $u=u[1]u[2]\cdots$ be an infinite word. For $n\in\mathbb N$, let $PPL_u(n)$ denote the minimum number of concatenated palindromes needed to express the prefix of $u$ of length…

Let $x$ be an infinite word over an alphabet $\mathcal{A}$. A super-monochromatic factorisation of a suffix of $x$ is a factorisation into finite words such that all factors and ev…

Let $n$ be chosen, let $u$ and $v$ be glides with fixed reduced words $u=s_{i_1}\cdots s_{i_l}$ and $v=s_{j_1}\cdots s_{j_m}$, and assume that…