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

Mathematics Subject Classification ID

Combinatorics on words (68R15)

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

Cited in

(14)

• Abelian repetition threshold revisited
• Growth properties of power-free languages
• On Dejean's conjecture over large alphabets
• Finite-repetition threshold for infinite ternary words
• Avoiding or limiting regularities in words
• On Pansiot words avoiding 3-repetitions
• Bounds for the generalized repetition threshold
• Asymptotic repetitive threshold of balanced sequences
• The number of threshold words on \(n\) letters grows exponentially for every \(n \geq 27\)
• Subword complexity and power avoidance
• The repetition threshold for binary rich words
• On Pnsiot words avoiding 3-repetitions
• Transition property for cube-free words
• The weak circular repetition threshold over large alphabets

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)