1 problem

Fix $k\geqslant 1$. A word is called $k$-anagram-free if every factor $F$ satisfies $\alpha(F)\geqslant k+1$, where $\alpha(F)$ is the least number of cuts needed to decompose $F$…