On Dejean’s conjecture over large alphabets

The (maximal) exponent of a non-empty finite word is the ratio of its length to its period. Dejean (1972) conjectured that for any n≥5 there exists an infinite word over n letters with no factor of its exponent larger than n/(n−1). We prove that this conjecture is true for n≥33.