On two stronger versions of Dejean's conjecture

DOI10.1007/978-3-642-32589-2_69zbMATH Open1365.68365OpenAlexW44219933MaRDI QIDQ2912779FDOQ2912779

Authors: Igor N. Tunev, Arseny M. Shur 

Publication date: 25 September 2012

Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32589-2_69

Recommendations

• On the Repetition Threshold for Large Alphabets
• Finite repetition threshold for large alphabets
• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• Finite-repetition threshold for infinite ternary words
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cited In (10)

• Asymptotic repetitive threshold of balanced sequences
• Bounds for the generalized repetition threshold
• Subword complexity and power avoidance
• On Dejean's conjecture over large alphabets
• The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$
• Growth properties of power-free languages
• Transition property for cube-free words
• Avoiding or Limiting Regularities in Words
• On Pnsiot words avoiding 3-repetitions
• Abelian repetition threshold revisited

This page was built for publication: On two stronger versions of Dejean's conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912779)