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 epsilon., the number of distinct factors of w with exponent larger than 1 + epsilon is finite. (C) 2009 Elsevier B.V. All rights reserved.
repetition fractional exponent repetitivity index combinatorial problems