Dejean's conjecture holds for N ≥ 27
Authors:
- 29 September 2009
- journal article
- research article
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 43 (4) , 775-778
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.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Dejean’s conjecture holds forTheoretical Computer Science, 2009
- On Dejean’s conjecture over large alphabetsTheoretical Computer Science, 2007
- Dejean’s conjecture and Sturmian wordsEuropean Journal of Combinatorics, 2007
- A generalization of repetition thresholdTheoretical Computer Science, 2005
- Proof of Dejean's conjecture for alphabets with 5, 6, 7, 8, 9, 10 and 11 lettersTheoretical Computer Science, 1992
- Repetitions in the Fibonacci infinite wordRAIRO - Theoretical Informatics and Applications, 1992
- Uniformly growing k-th power-free homomorphismsTheoretical Computer Science, 1988
- A propos d'une conjecture de F. Dejean sur les répétitions dans les motsDiscrete Applied Mathematics, 1984
- NON-REPETITIVE SEQUENCES ON THREE SYMBOLSThe Quarterly Journal of Mathematics, 1983
- Sur un théorème de ThueJournal of Combinatorial Theory, Series A, 1972