Pages that link to "Item:Q3653095"
From MaRDI portal
The following pages link to Dejean's conjecture holds for N ≥ 27 (Q3653095):
Displayed 18 items.
- Minimal critical exponent of quasiperiodic words (Q401485) (← links)
- Growth properties of power-free languages (Q465700) (← links)
- Bounds for the generalized repetition threshold (Q544880) (← links)
- Last cases of Dejean's conjecture (Q544887) (← links)
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters (Q650879) (← links)
- Growth of power-free languages over large alphabets (Q1678750) (← links)
- On repetition thresholds of caterpillars and trees of bounded degree (Q1753030) (← links)
- Extremal overlap-free and extremal \(\beta\)-free binary words (Q2215463) (← links)
- Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture (Q2420559) (← links)
- The undirected repetition threshold and undirected pattern avoidance (Q2662683) (← links)
- ON PANSIOT WORDS AVOIDING 3-REPETITIONS (Q2841970) (← links)
- On the D0L Repetition Threshold (Q3060199) (← links)
- A proof of Dejean’s conjecture (Q3168740) (← links)
- The weak circular repetition threshold over large alphabets (Q5021102) (← 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)
- On the growth rates of complexity of threshold languages (Q5190085) (← links)
- Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings (Q6169968) (← links)