The following pages link to Last cases of Dejean's conjecture (Q544887):
Displaying 50 items.
- Infinite words containing the minimal number of repetitions (Q396642) (← links)
- Minimal critical exponent of quasiperiodic words (Q401485) (← links)
- Growth properties of power-free languages (Q465700) (← links)
- On some generalizations of abelian power avoidability (Q496047) (← links)
- Efficient computation of maximal anti-exponent in palindrome-free strings (Q507406) (← links)
- Bounds for the generalized repetition threshold (Q544880) (← links)
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters (Q650879) (← links)
- Fewest repetitions versus maximal-exponent powers in infinite binary words (Q650894) (← links)
- Branching frequency and Markov entropy of repetition-free languages (Q832956) (← links)
- Computing maximal-exponent factors in an overlap-free word (Q899581) (← links)
- Growth rates of complexity of power-free languages (Q986556) (← links)
- Growth of power-free languages over large alphabets (Q1678750) (← links)
- On repetition thresholds of caterpillars and trees of bounded degree (Q1753030) (← links)
- Nonrepetitive list colorings of the integers (Q2033476) (← links)
- Abelian repetition threshold revisited (Q2097234) (← links)
- The critical exponent functions (Q2131735) (← links)
- Avoidance of split overlaps (Q2214038) (← links)
- Extremal overlap-free and extremal \(\beta\)-free binary words (Q2215463) (← links)
- Avoiding abelian powers cyclically (Q2221763) (← links)
- Ostrowski-automatic sequences: theory and applications (Q2222098) (← links)
- Lower-bounds on the growth of power-free languages over large alphabets (Q2230725) (← links)
- On shuffling of infinite square-free words (Q2260629) (← links)
- Repetition avoidance in products of factors (Q2272409) (← links)
- Subword complexity and power avoidance (Q2326389) (← links)
- Infinite binary words containing repetitions of odd period (Q2339599) (← links)
- Rich square-free words (Q2357378) (← links)
- Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture (Q2420559) (← links)
- \((2+\epsilon )\)-nonrepetitive list colouring of paths (Q2631100) (← links)
- Avoiding letter patterns in ternary square-free words (Q2635082) (← links)
- The undirected repetition threshold and undirected pattern avoidance (Q2662683) (← links)
- On minimal critical exponent of balanced sequences (Q2672583) (← links)
- ON PANSIOT WORDS AVOIDING 3-REPETITIONS (Q2841970) (← links)
- Fewest repetitions in infinite binary words (Q2911423) (← links)
- On Abelian repetition threshold (Q2911433) (← links)
- Highly nonrepetitive sequences: Winning strategies from the local lemma (Q3068764) (← links)
- A proof of Dejean’s conjecture (Q3168740) (← links)
- Dejean's conjecture holds for N ≥ 27 (Q3653095) (← links)
- Avoiding or Limiting Regularities in Words (Q4613549) (← links)
- On avoidability of formulas with reversal (Q4638263) (← links)
- (Q4704136) (← links)
- The weak circular repetition threshold over large alphabets (Q5021102) (← links)
- Transition Property for $$\alpha $$-Power Free Languages with $$\alpha \ge 2$$ and $$k\ge 3$$ Letters (Q5041268) (← links)
- The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ (Q5109538) (← links)
- The repetition threshold for binary rich words (Q5130737) (← links)
- Asymptotic repetitive threshold of balanced sequences (Q5879125) (← links)
- Nonrepetitive and pattern-free colorings of the plane (Q5964253) (← links)
- Interview with Jeffrey Shallit (Q6098018) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
- Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings (Q6169968) (← links)
- Extensions and reductions of squarefree words (Q6177427) (← links)
