Dejean's conjecture holds for n ≥ 30

被引：16
|
作者：
Currie, James [1 ]
Rampersad, Narad [1 ]
机构：
[1] Univ Winnipeg, Dept Math & Stat, Winnipeg, MB R3B 2E9, Canada
来源：
THEORETICAL COMPUTER SCIENCE | 2009年 / 410卷 / 30-32期
基金：
加拿大自然科学与工程研究理事会;
关键词：
Repetitive threshold; Fractional power; Dejean's conjecture; REPETITIONS; WORDS;
D O I：
10.1016/j.tcs.2009.01.026
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We extend Carpi's results by showing that Dejean's conjecture holds for n >= 30. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码：2885 / 2888
页数：4
相关论文
共 50 条
  • [1] DEJEAN'S CONJECTURE HOLDS FOR N ≥ 27
    Currie, James
    Rampersad, Narad
    [J]. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2009, 43 (04): : 775 - 778
  • [2] A PROOF OF DEJEAN'S CONJECTURE
    Currie, James
    Rampersad, Narad
    [J]. MATHEMATICS OF COMPUTATION, 2011, 80 (274) : 1063 - 1070
  • [3] Last cases of Dejean's conjecture
    Rao, Michael
    [J]. THEORETICAL COMPUTER SCIENCE, 2011, 412 (27) : 3010 - 3018
  • [4] Dejean's conjecture and Sturmian words
    Mohammad-Noori, M.
    Currie, James D.
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2007, 28 (03) : 876 - 890
  • [5] Dejean's conjecture and letter frequency
    Chalopin, Jeremie
    Ochem, Pascal
    [J]. RAIRO-THEORETICAL INFORMATICS AND APPLICATIONS, 2008, 42 (03): : 477 - 480
  • [6] On Dejean's conjecture over large alphabets
    Carpi, Arturo
    [J]. THEORETICAL COMPUTER SCIENCE, 2007, 385 (1-3) : 137 - 151
  • [7] On Two Stronger Versions of Dejean's Conjecture
    Tunev, Igor N.
    Shur, Arseny M.
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012, 2012, 7464 : 800 - 812
  • [8] Fuglede's conjecture holds in Qp
    Fan, Aihua
    Fan, Shilei
    Liao, Lingmin
    Shi, Ruxi
    [J]. MATHEMATISCHE ANNALEN, 2019, 375 (1-2) : 315 - 341
  • [9] The Conjecture on the Crossing Number of K1,m,n is true if Zarankiewicz's Conjecture Holds
    Yang, Xiwu
    Wang, Yizhen
    [J]. GRAPHS AND COMBINATORICS, 2021, 37 (03) : 1083 - 1088
  • [10] Meyniel's conjecture holds for random graphs
    Pralat, Pawel
    Wormald, Nicholas
    [J]. RANDOM STRUCTURES & ALGORITHMS, 2016, 48 (02) : 396 - 421
12345