On a word avoiding near repeats

In this paper we construct an infinite binary word w with the following property: the minimal distance among two occurrences of a same factor of length n cannot be polynomially upperbounded. In particular, for all positive ε the number of distinct factors of w with exponent larger than 1+ε is finite.