Pages that link to "Item:Q2456366"
From MaRDI portal
The following pages link to On Dejean's conjecture over large alphabets (Q2456366):
Displayed 19 items.
- 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 rates of complexity of power-free languages (Q986556) (← links)
- On a word avoiding near repeats (Q989452) (← links)
- A generalization of Thue freeness for partial words (Q1006051) (← links)
- On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\) (Q2271420) (← links)
- Dejean's conjecture holds for \(n\geq 30\) (Q2271427) (← links)
- ON PANSIOT WORDS AVOIDING 3-REPETITIONS (Q2841970) (← links)
- ON THE EXISTENCE OF MINIMAL β-POWERS (Q2909104) (← 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)
- 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 (Q5900364) (← links)