Almost optimal searching of maximal subrepetitions in a word

Roman Kolpakov

For $0<\delta <1$ a $\delta$-subrepetition in a word is a factor which exponent is less than~2 but is not less than $1+\delta$ (the exponent of the factor is the ratio of the factor length to its…