The following pages link to Sur un théorème de Thue (Q2555163):
Displaying 50 items.
- 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)
- Growth of power-free languages over large alphabets (Q1678750) (← links)
- On repetition thresholds of caterpillars and trees of bounded degree (Q1753030) (← 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)
- Nonrepetitive list colorings of the integers (Q2033476) (← links)
- Abelian repetition threshold revisited (Q2097234) (← links)
- On balanced sequences and their critical exponent (Q2098168) (← links)
- Fractional meanings of nonrepetitiveness (Q2120819) (← links)
- The critical exponent functions (Q2131735) (← links)
- On non-repetitive sequences of arithmetic progressions: the cases \(k\in\{4,5,6,7,8\}\) (Q2181220) (← links)
- Avoiding 5/4-powers on the alphabet of nonnegative integers (Q2194095) (← links)
- Avoidance of split overlaps (Q2214038) (← links)
- Extremal overlap-free and extremal \(\beta\)-free binary words (Q2215463) (← links)
- Ostrowski-automatic sequences: theory and applications (Q2222098) (← links)
- Lower-bounds on the growth of power-free languages over large alphabets (Q2230725) (← links)
- On balanced sequences and their asymptotic critical exponent (Q2232290) (← 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)
- Rich square-free words (Q2357378) (← links)
- Reversals and palindromes in continued fractions (Q2373747) (← links)
- Letter frequency in infinite repetition-free words (Q2373761) (← links)
- Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture (Q2420559) (← links)
- On Dejean's conjecture over large alphabets (Q2456366) (← links)
- A generalization of repetition threshold (Q2575754) (← links)
- \((2+\epsilon )\)-nonrepetitive list colouring of paths (Q2631100) (← links)
- Avoiding letter patterns in ternary square-free words (Q2635082) (← links)
- The undirected repetition threshold and undirected pattern avoidance (Q2662683) (← links)
- On minimal critical exponent of balanced sequences (Q2672583) (← links)
- The easily bored sequence (Q2676983) (← links)
- Ternary Square-Free Partial Words with Many Wildcards (Q2817387) (← links)
- ON PANSIOT WORDS AVOIDING 3-REPETITIONS (Q2841970) (← links)
- ON THE EXISTENCE OF MINIMAL β-POWERS (Q2909104) (← links)
- Fewest repetitions in infinite binary words (Q2911423) (← links)
- Repetition thresholds for subdivided graphs and trees (Q2911431) (← links)
- On Abelian repetition threshold (Q2911433) (← links)
- On the D0L Repetition Threshold (Q3060199) (← links)
- A proof of Dejean’s conjecture (Q3168740) (← links)