The following pages link to Sur un théorème de Thue (Q2555163):
Displayed 48 items.
- Bounds for the generalized repetition threshold (Q544880) (← links)
- Last cases of Dejean's conjecture (Q544887) (← links)
- Pattern avoidance: themes and variations (Q557911) (← links)
- Polynomial versus exponential growth in repetition-free binary words (Q598459) (← links)
- Growth of power-free languages: numerical and asymptotic bounds (Q610578) (← links)
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots (Q792102) (← links)
- Dejean's conjecture and Sturmian words (Q872047) (← links)
- Cancellation in semigroups in which \(x^ 2=x^ 3\) (Q909798) (← links)
- Thue type problems for graphs, points, and numbers (Q941381) (← links)
- Growth rates of complexity of power-free languages (Q986556) (← links)
- On a word avoiding near repeats (Q989452) (← links)
- On maximal repetitions of arbitrary exponent (Q991771) (← links)
- Every real number greater than 1 is a critical exponent (Q995572) (← links)
- A generalization of Thue freeness for partial words (Q1006051) (← links)
- Repetition-free words (Q1078338) (← links)
- Multidimensional unrepetitive configurations (Q1106022) (← links)
- Mots sans carre et morphismes iterés (Q1144665) (← links)
- Proof of Dejean's conjecture for alphabets with \(5, 6, 7, 8, 9, 10\) and \(11\) letters (Q1184978) (← links)
- On repetition-free binary words of minimal density (Q1292490) (← links)
- On repeated factors in \(C^\infty\)-words (Q1342256) (← links)
- The set of \(k\)-power free words over \(\Sigma\) is empty or perfect (Q1399694) (← links)
- On cube-free \(\omega\)-words generated by binary morphisms (Q1835915) (← links)
- Uniformly growing k-th power-free homomorphisms (Q1838047) (← links)
- On the structure and extendibility of \(k\)-power free words (Q1891362) (← links)
- Non-repetitive words: Ages and essences (Q1912750) (← links)
- Words strongly avoiding fractional powers (Q1970068) (← 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)
- Reversals and palindromes in continued fractions (Q2373747) (← links)
- Letter frequency in infinite repetition-free words (Q2373761) (← links)
- On Dejean's conjecture over large alphabets (Q2456366) (← links)
- A generalization of repetition threshold (Q2575754) (← links)
- On the D0L Repetition Threshold (Q3060199) (← 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)
- Repetitions in the Fibonacci infinite word (Q4012668) (← links)
- (Q4147595) (← links)
- On the growth rates of complexity of threshold languages (Q5190085) (← links)
- WORDS AVOIDING $\frac{7}{3}$-POWERS AND THE THUE–MORSE MORPHISM (Q5462674) (← links)
- WORD COMPLEXITY AND REPETITIONS IN WORDS (Q5696964) (← links)
- Dejean's conjecture and letter frequency (Q5899396) (← links)
- Dejean's conjecture and letter frequency (Q5900364) (← links)
- On factor graphs of DOL words (Q5954087) (← links)
- On combinatorial properties of the Arshon sequence (Q5954090) (← links)