A proof of Dejean’s conjecture
- 30 August 2010
- journal article
- Published by American Mathematical Society (AMS) in Mathematics of Computation
- Vol. 80 (274) , 1063-1070
Abstract
We prove Dejean’s conjecture. Specifically, we show that Dejean’s conjecture holds for the last remaining open values of n n , namely 15 ≤ n ≤ 26 15 \leq n \leq 26 .Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Dejean’s conjecture holds forTheoretical Computer Science, 2009
- On Dejean’s conjecture over large alphabetsTheoretical Computer Science, 2007
- On critical exponents in fixed points of non-erasing morphismsTheoretical Computer Science, 2007
- Dejean’s conjecture and Sturmian wordsEuropean Journal of Combinatorics, 2007
- A generalization of repetition thresholdTheoretical Computer Science, 2005
- Algebraic Combinatorics on Words2002
- Repetitions in the Fibonacci infinite wordRAIRO - Theoretical Informatics and Applications, 1992
- Uniformly growing k-th power-free homomorphismsTheoretical Computer Science, 1988
- NON-REPETITIVE SEQUENCES ON THREE SYMBOLSThe Quarterly Journal of Mathematics, 1983
- Sur un théorème de ThueJournal of Combinatorial Theory, Series A, 1972