Suppose we have an alphabet $E = \{x_1,x_2,...x_k\}$. Then according to (https://arxiv.org/pdf/1902.05540.pdf, page 2), Zimin words are unavoidable. How does word $w = (x_1)(x_1)(x_1)\ldots$ not violate this?
In the paper, it is mentioned that a condition is that w must be sufficiently large. What do they mean, exactly? The example above is infinite, so it must be sufficiently large.