Pages that link to "Item:Q2271427"

The following pages link to Dejean's conjecture holds for \(n\geq 30\) (Q2271427):

Displaying 16 items.

• Minimal critical exponent of quasiperiodic words (Q401485) (← 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)
• On repetition thresholds of caterpillars and trees of bounded degree (Q1753030) (← 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)
• Infinite binary words containing repetitions of odd period (Q2339599) (← links)
• Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture (Q2420559) (← links)
• On the D0L Repetition Threshold (Q3060199) (← links)
• Highly nonrepetitive sequences: Winning strategies from the local lemma (Q3068764) (← links)
• A proof of Dejean’s conjecture (Q3168740) (← links)
• Dejean's conjecture holds for N ≥ 27 (Q3653095) (← 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)
• Tight Upper Bounds on Distinct Maximal (Sub-)Repetitions in Highly Compressible Strings (Q6169968) (← links)