A generalization of repetition threshold
From MaRDI portal
Publication:2575754
DOI10.1016/J.TCS.2005.07.016zbMATH Open1079.68082arXivmath/0310144OpenAlexW1999696434MaRDI QIDQ2575754FDOQ2575754
Jeffrey Shallit, Pascal Ochem, Lucian Ilie
Publication date: 6 December 2005
Published in: Theoretical Computer Science, Lecture Notes in Computer Science (Search for Journal in Brave)
Abstract: Brandenburg and (implicitly) Dejean introduced the concept of repetition threshold: the smallest real number alpha such that there exists an infinite word over a k-letter alphabet that avoids beta-powers for all beta>alpha. We generalize this concept to include the lengths of the avoided words. We give some conjectures supported by numerical evidence and prove one of these conjectures.
Full work available at URL: https://arxiv.org/abs/math/0310144
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- How many squares must a binary sequence contain?
- Uniformly growing k-th power-free homomorphisms
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Infinite 0-1 sequences without long adjacent identical blocks
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters
- On nonrepetitive sequences
- Sur un théorème de Thue
- SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
- A generalization of repetition threshold
- On repetitions of blocks in binary sequences
Cited In (20)
- ON THE REPETITIVITY INDEX OF INFINITE WORDS
- On the D0L Repetition Threshold
- Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture
- A fixed rehearsal capacity interpretation of limits on absolute identification performance
- Bounds for the generalized repetition threshold
- Antisquares and critical exponents
- Fewest repetitions versus maximal-exponent powers in infinite binary words
- Dejean's conjecture holds for \(n\geq 30\)
- On a word avoiding near repeats
- On Dejean's conjecture over large alphabets
- Letter frequency in infinite repetition-free words
- Repetition avoidance in products of factors
- A generalization of repetition threshold
- Avoidability of formulas with two variables
- A proof of Dejean’s conjecture
- A generator of morphisms for infinite words
- Avoiding conjugacy classes on the 5-letter alphabet
- Avoiding or Limiting Regularities in Words
- Dejean's conjecture holds for N ≥ 27
- Doubled patterns with reversal and square-free doubled patterns
Recommendations
This page was built for publication: A generalization of repetition threshold
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2575754)
