Dejean’s conjecture and Sturmian words

A proof of Dejean’s conjecture

“…Moulin Ollagnier [13] verified Dejean's conjecture for 5 ≤ n ≤ 11, and Mohammad-Noori and Currie [12] proved the conjecture for 12 ≤ n ≤ 14. Recently, Carpi [3] showed that Dejean's conjecture holds for n ≥ 33.…”

On a word avoiding near repeats

“…n 11[9], 12 n 14[8] and n 33[3]. An extension of this problem taking into account only 'sufficiently long' factors is considered in[5].…”

Least Periods of Factors of Infinite Words

“…Now we will adopt a notation from [13]. For each integer n ≥ 1, there exists a unique representation…”