Pages that link to "Item:Q1184978"
From MaRDI portal
The following pages link to Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters (Q1184978):
Displayed 27 items.
- Bounds for the generalized repetition threshold (Q544880) (← links)
- Last cases of Dejean's conjecture (Q544887) (← links)
- Pattern avoidance: themes and variations (Q557911) (← links)
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters (Q650879) (← links)
- Dejean's conjecture and Sturmian words (Q872047) (← links)
- Thue type problems for graphs, points, and numbers (Q941381) (← links)
- On a word avoiding near repeats (Q989452) (← links)
- On repeated factors in \(C^\infty\)-words (Q1342256) (← links)
- Repetitiveness of languages generated by morphisms (Q1575438) (← links)
- Words strongly avoiding fractional powers (Q1970068) (← links)
- Dejean's conjecture holds for \(n\geq 30\) (Q2271427) (← links)
- Letter frequency in infinite repetition-free words (Q2373761) (← links)
- On Dejean's conjecture over large alphabets (Q2456366) (← links)
- Growth of repetition-free words -- a review (Q2484440) (← links)
- A generalization of repetition threshold (Q2575754) (← links)
- ON PANSIOT WORDS AVOIDING 3-REPETITIONS (Q2841970) (← links)
- On the D0L Repetition Threshold (Q3060199) (← links)
- Highly nonrepetitive sequences: Winning strategies from the local lemma (Q3068764) (← links)
- A proof of Dejean’s conjecture (Q3168740) (← links)
- A generator of morphisms for infinite words (Q3421905) (← links)
- On extremal properties of the Fibonacci word (Q3537492) (← links)
- AVOIDING APPROXIMATE SQUARES (Q3538854) (← links)
- ON THE REPETITIVITY INDEX OF INFINITE WORDS (Q3636020) (← links)
- Dejean's conjecture holds for N ≥ 27 (Q3653095) (← links)
- On the growth rates of complexity of threshold languages (Q5190085) (← links)
- Dejean's conjecture and letter frequency (Q5899396) (← links)
- Dejean's conjecture and letter frequency (Q5900364) (← links)
