A PROOF OF DEJEAN’S CONJECTURE

A PROOF OF DEJEAN’S CONJECTURE (905)

Cached

Download Links

by James Currie , Narad Rampersad

BibTeX

@MISC{Currie905aproof,
    author = {James Currie and Narad Rampersad},
    title = {A PROOF OF DEJEAN’S CONJECTURE},
    year = {905}
}

Bookmark

OpenURL

Abstract

Abstract. We prove Dejean’s conjecture. Specifically, we show that Dejean’s conjecture holds for the last remaining open values of n, namely 15 ≤ n ≤ 26. 1.

Citations

481	Combinatorics on Words - Lothaire - 1983
91	Über die gegenseitige Lage gleicher Teile gewisser Zeichenreihen - Thue - 1912
79	Über unendliche Zeichenreihen, Norske - Thue - 1906
32	Sur un théorème de Thue - Dejean - 1972
26	Uniformly growing k-th powerfree homomorphisms, Theoret - Brandenburg - 1983
19	Repetitions in the Fibonacci infinite word - Mignosi, Pirillo - 1992
15	Non-repetitive sequences on three symbols, Quart - Brinkhuis - 1983
15	A propos d’une conjecture de F. Dejean sur les répétitions dans les mots - Pansiot - 1984
7	Proof of Dejean’s conjecture for alphabets with 5 - Moulin-Ollagnier - 1992
6	On Dejean’s conjecture over large alphabets, Theoret - Carpi - 2007
6	Dejean’s conjecture and Sturmian words - Mohammad-Noori, Currie
4	On critical exponents in fixed points of non-erasing morphisms, Theoret - Krieger
3	On the growth rates of complexity of threshold languages - Shur, Gorbunova - 2008
2	Dejean’s conjecture holds for n ≥ 30 - Currie, Rampersad
2	A generalization of repetition threshold, Theoret - Ilie, Ochem, et al.
2	Ollagnier, Proof of Dejean’s conjecture for alphabets with 5 - Moulin - 1992
1	Dejean’s conjecture holds for n ≥ 27 - Currie, Rampersad