Bounds for the generalized repetition threshold

DOI10.1016/J.TCS.2010.10.009MaRDI QIDQ544880zbMATH OpenOpenAlexFDO

Authors Francesca Fiorenzi, Pascal Ochem, Elise Vaslet

Publication date 16 June 2011

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2010.10.009

zbMATH Keywords

Dejean's conjecturerepetition threshold

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• On the D0L Repetition Threshold
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• On two stronger versions of Dejean's conjecture

Cites work

• A proof of Dejean’s conjecture
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• Dejean's conjecture and Sturmian words
• Dejean's conjecture holds for N ≥ 27
• Last cases of Dejean's conjecture
• On Dejean's conjecture over large alphabets
• Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
• Sur un théorème de Thue
• Uniformly growing k-th power-free homomorphisms

Cited in

(9)

• On an efficient method for estimating the number of nonrepeating words
• Avoiding or limiting regularities in words
• Repetition avoidance in products of factors
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• On the D0L Repetition Threshold
• On Abelian repetition threshold
• Antisquares and critical exponents
• Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
• On repetition thresholds of caterpillars and trees of bounded degree

This page was built for publication: Bounds for the generalized repetition threshold

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