We show that Dejean’s conjecture holds for n ≥ 27. This brings the final resolution of the conjecture by the approach of Moulin Ollagnier within range of the computationally feasible. Repetitions in words have been studied since the beginning of the previous century [14, 15]. Recently, there has been much interest in repetitions with fractional exponent [1, 3, 6, 7, 8, 10]. For rational 1 < r ≤...
