Proof of Dejean's conjecture for alphabets with 5, 6, 7, 8, 9, 10 and 11 letters
Theoretical Computer Science
Dejean's conjecture and Sturmian words
European Journal of Combinatorics
Letter frequency in infinite repetition-free words
Theoretical Computer Science
On Dejean's conjecture over large alphabets
Theoretical Computer Science
Dejean's conjecture holds for n≥30
Theoretical Computer Science
Bounds for the generalized repetition threshold
Theoretical Computer Science
Fewest repetitions versus maximal-exponent powers in infinite binary words
Theoretical Computer Science
On two stronger versions of dejean's conjecture
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Computing the maximal-exponent repeats of an overlap-free string in linear time
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
Infinite words containing the minimal number of repetitions
Journal of Discrete Algorithms
Growth of Power-Free Languages over Large Alphabets
Theory of Computing Systems
| Hi-index | 5.23 |
Dejean conjectured that the repetition threshold for a k-letter alphabet is kk-1 when k=5. Dejean's conjecture has already been proved for k@?14 and for k=27. We present here a proof for 8@?k@?38. The same technique is also applied to prove Ochem's stronger version of the conjecture for 9@?k@?38.