Pages that link to "Item:Q2456366"
From MaRDI portal
The following pages link to On Dejean's conjecture over large alphabets (Q2456366):
Displaying 44 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)
- Counting maximal-exponent factors in words (Q728262) (← links)
- Branching frequency and Markov entropy of repetition-free languages (Q832956) (← 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)
- 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)
- Fractional meanings of nonrepetitiveness (Q2120819) (← links)
- Extremal overlap-free and extremal \(\beta\)-free binary words (Q2215463) (← 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)
- Repetition avoidance in products of factors (Q2272409) (← links)
- Subword complexity and power avoidance (Q2326389) (← links)
- Critical exponent of infinite balanced words via the Pell number system (Q2333033) (← 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)
- 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)
- 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)
- 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)
- On the growth rates of complexity of threshold languages (Q5190085) (← links)
- Asymptotic repetitive threshold of balanced sequences (Q5879125) (← links)
- Dejean's conjecture and letter frequency (Q5900364) (← links)
- Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings (Q6169968) (← links)
- Extensions and reductions of squarefree words (Q6177427) (← links)
- An upper bound on asymptotic repetition threshold of balanced sequences via colouring of the Fibonacci sequence (Q6204547) (← links)
