The following pages link to On nonrepetitive sequences (Q1394229):
Displaying 40 items.
- Infinite words containing the minimal number of repetitions (Q396642) (← links)
- On some generalizations of abelian power avoidability (Q496047) (← links)
- Relations on words (Q505060) (← links)
- Spiraling and folding: the word view (Q548656) (← links)
- Avoiding large squares in partial words (Q551207) (← links)
- Avoiding large squares in infinite binary words (Q557912) (← links)
- Cyclically repetition-free words on small alphabets (Q765486) (← links)
- A powerful abelian square-free substitution over 4 letters (Q837181) (← links)
- Pattern avoidance on graphs (Q878624) (← links)
- Binary words with a given Diophantine exponent (Q1034641) (← links)
- Infinite 0-1 sequences without long adjacent identical blocks (Q1132880) (← links)
- Collinear subsets of lattice point sequences -- an analog of Szemeredi's theorem (Q1137067) (← links)
- Every binary pattern of length six is avoidable on the two-letter alphabet (Q1186515) (← links)
- On repetitions of blocks in binary sequences (Q1225054) (← links)
- How many squares can a string contain? (Q1268630) (← links)
- Hierarchie et fermeture de certaines classes de tag-systèmes (Q1837537) (← links)
- Non-repetitive colorings of infinite sets (Q1874373) (← links)
- On the structure and extendibility of \(k\)-power free words (Q1891362) (← links)
- Non-repetitive words: Ages and essences (Q1912750) (← links)
- Repetitions in Toeplitz words and the Thue threshold (Q2106611) (← links)
- Say no to case analysis: automating the drudgery of case-based proofs (Q2117657) (← links)
- The complexity of unavoidable word patterns (Q2158299) (← links)
- New bounds on antipowers in words (Q2203608) (← links)
- Avoiding 2-binomial squares and cubes (Q2257294) (← links)
- Chains and fixing blocks in irreducible binary sequences (Q2266018) (← links)
- Hairpin structures defined by DNA trajectories (Q2272214) (← links)
- Infinite binary words containing repetitions of odd period (Q2339599) (← links)
- Words avoiding repetitions in arithmetic progressions (Q2474231) (← links)
- A generalization of repetition threshold (Q2575754) (← links)
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY (Q3016224) (← links)
- SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS (Q3022001) (← links)
- On extremal properties of the Fibonacci word (Q3537492) (← links)
- AVOIDING APPROXIMATE SQUARES (Q3538854) (← links)
- Avoiding or Limiting Regularities in Words (Q4613549) (← links)
- Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$ (Q4685343) (← links)
- The simplest binary word with only three squares (Q5021107) (← links)
- No extremal square-free words over large alphabets (Q5052160) (← links)
- Abelian squares are avoidable on 4 letters (Q5204304) (← links)
- Avoidability of long 𝑘-abelian repetitions (Q5741503) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
