Mathematics of Computation · 2010 · 82 citations · 14 references
Natural SciencesMathematicsNumber TheoryCombinatorial Number Theory
We prove Dejean’s conjecture. Specifically, we show that Dejean’s conjecture holds for the last remaining open values of <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="n"> <mml:semantics> <mml:mi>n</mml:mi> <mml:annotation encoding="application/x-tex">n</mml:annotation> </mml:semantics> </mml:math> </inline-formula> , namely <inline-formula content-type="math/mathml"> <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" alttext="15 less-than-or-equal-to n less-than-or-equal-to 26"> <mml:semantics> <mml:mrow> <mml:mn>15</mml:mn> <mml:mo> ≤ </mml:mo> <mml:mi>n</mml:mi> <mml:mo> ≤ </mml:mo> <mml:mn>26</mml:mn> </mml:mrow> <mml:annotation encoding="application/x-tex">15 \leq n \leq 26</mml:annotation> </mml:semantics> </mml:math> </inline-formula> .
14
Algebraic Combinatorics on Words
M. Lothaire · Cambridge University Press eBooks · 2002 · 1.8K citations
Last cases of Dejean’s conjecture
Michaël Rao · Theoretical Computer Science · 2010 · 92 citations
On Dejean’s conjecture over large alphabets
Arturo Carpi · Theoretical Computer Science · 2007 · 84 citations