Dejean's conjecture holds for n>=27

TL;DR

This paper proves Dejean's conjecture for all alphabet sizes n greater than or equal to 27, completing the proof for this range using computational methods.

Contribution

It finalizes the proof of Dejean's conjecture for n>=27, extending previous partial results through computational verification.

Findings

Dejean's conjecture is confirmed for n>=27

The proof utilizes computational methods within feasible range

Completes the conjecture's proof for all relevant n

Abstract

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.