Strongly non-repetitive sequences and progression-free sets
From MaRDI portal
Publication:1141145
DOI10.1016/0097-3165(79)90044-XzbMath0437.05011OpenAlexW2136069334MaRDI QIDQ1141145
Publication date: 1979
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(79)90044-x
Related Items (52)
On uniformly repetitive semigroups ⋮ Avoidability of Additive Cubes over Alphabets of Four Numbers ⋮ Branching frequency and Markov entropy of repetition-free languages ⋮ A powerful abelian square-free substitution over 4 letters ⋮ On the structure and extendibility of \(k\)-power free words ⋮ Anagram-Free Colourings of Graphs ⋮ Long binary patterns are abelian 2-avoidable ⋮ Maximum number of distinct and nonequivalent nonstandard squares in a word ⋮ On Abelian repetition threshold ⋮ Avoiding Three Consecutive Blocks of the Same Size and Same Sum ⋮ On Growth and Fluctuation of k-Abelian Complexity ⋮ Non-repetitive words: Ages and essences ⋮ Facial anagram-free edge-coloring of plane graphs ⋮ On growth and fluctuation of \(k\)-abelian complexity ⋮ The number of binary words avoiding Abelian fourth powers grows exponentially ⋮ The undirected repetition threshold and undirected pattern avoidance ⋮ On abelian 2-avoidable binary patterns ⋮ On \(k\)-abelian avoidability ⋮ On the number of Abelian square-free words on four letters ⋮ On a generalization of abelian equivalence and complexity of infinite words ⋮ Collinear subsets of lattice point sequences -- an analog of Szemeredi's theorem ⋮ Abelian combinatorics on words: a survey ⋮ Fixed points avoiding abelian \(k\)-powers ⋮ Avoiding or Limiting Regularities in Words ⋮ Avoiding Abelian squares in partial words ⋮ Abelian repetitions in partial words ⋮ Avoiding abelian powers cyclically ⋮ Words strongly avoiding fractional powers ⋮ On highly palindromic words: the \(n\)-ary case ⋮ Local Squares, Periodicity and Finite Automata ⋮ Thue type problems for graphs, points, and numbers ⋮ On some generalizations of abelian power avoidability ⋮ Relations on words ⋮ AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY ⋮ Anagram-free graph colouring ⋮ Properties of integers and finiteness conditions for semigroups ⋮ Avoiding 2-binomial squares and cubes ⋮ ALGORITHMIC COMBINATORICS ON PARTIAL WORDS ⋮ Avoidability of long 𝑘-abelian repetitions ⋮ Chains and fixing blocks in irreducible binary sequences ⋮ Pattern avoidance: themes and variations ⋮ Problems in between words and abelian words: \(k\)-abelian avoidability ⋮ Unnamed Item ⋮ Coloring factors of substitutive infinite words ⋮ Abelian squares are avoidable on 4 letters ⋮ Large subsets of discrete hypersurfaces in \(\mathbb Z^d\) contain arbitrarily many collinear points ⋮ A cyclic binary morphism avoiding abelian fourth powers ⋮ Splitting necklaces and measurable colorings of the real line ⋮ On Abelian squares and substitutions ⋮ Repetitive perhaps, but certainly not boring ⋮ Abelian repetition threshold revisited ⋮ On a generalization of Thue sequences
Cites Work
This page was built for publication: Strongly non-repetitive sequences and progression-free sets
