On nonrepetitive sequences

DOI10.1016/0097-3165(74)90041-7zbMath0279.05001OpenAlexW2016879150MaRDI QIDQ1394229

D. E. Jackson, J. A. Schatz, Roger Entringer

Publication date: 1974

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(74)90041-7

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items

Non-repetitive colorings of infinite sets ⋮ A powerful abelian square-free substitution over 4 letters ⋮ No extremal square-free words over large alphabets ⋮ On the structure and extendibility of \(k\)-power free words ⋮ The complexity of unavoidable word patterns ⋮ Non-repetitive words: Ages and essences ⋮ Pattern avoidance on graphs ⋮ Infinite 0-1 sequences without long adjacent identical blocks ⋮ Infinite words containing the minimal number of repetitions ⋮ Collinear subsets of lattice point sequences -- an analog of Szemeredi's theorem ⋮ Abelian combinatorics on words: a survey ⋮ New bounds on antipowers in words ⋮ Avoiding or Limiting Regularities in Words ⋮ On extremal properties of the Fibonacci word ⋮ AVOIDING APPROXIMATE SQUARES ⋮ On some generalizations of abelian power avoidability ⋮ Every binary pattern of length six is avoidable on the two-letter alphabet ⋮ Relations on words ⋮ AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY ⋮ Words avoiding repetitions in arithmetic progressions ⋮ SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS ⋮ Avoiding 2-binomial squares and cubes ⋮ Avoidability of long 𝑘-abelian repetitions ⋮ Spiraling and folding: the word view ⋮ Avoiding large squares in partial words ⋮ Chains and fixing blocks in irreducible binary sequences ⋮ Avoiding large squares in infinite binary words ⋮ On repetitions of blocks in binary sequences ⋮ Hairpin structures defined by DNA trajectories ⋮ Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$ ⋮ Abelian squares are avoidable on 4 letters ⋮ How many squares can a string contain? ⋮ Cyclically repetition-free words on small alphabets ⋮ Binary words with a given Diophantine exponent ⋮ Hierarchie et fermeture de certaines classes de tag-systèmes ⋮ A generalization of repetition threshold ⋮ Infinite binary words containing repetitions of odd period ⋮ Repetitions in Toeplitz words and the Thue threshold ⋮ The simplest binary word with only three squares ⋮ Say no to case analysis: automating the drudgery of case-based proofs

Cites Work

• Is There a Sequence on Four Symbols in Which No Two Adjacent Segments are Permutations of One Another?
• Unnamed Item
• Unnamed Item
• Unnamed Item