Pages that link to "Item:Q1141145"
From MaRDI portal
The following pages link to Strongly non-repetitive sequences and progression-free sets (Q1141145):
Displaying 50 items.
- Maximum number of distinct and nonequivalent nonstandard squares in a word (Q313973) (← links)
- On \(k\)-abelian avoidability (Q376138) (← links)
- On a generalization of abelian equivalence and complexity of infinite words (Q388738) (← links)
- Fixed points avoiding abelian \(k\)-powers (Q412180) (← links)
- On some generalizations of abelian power avoidability (Q496047) (← links)
- Relations on words (Q505060) (← links)
- Pattern avoidance: themes and variations (Q557911) (← links)
- The number of binary words avoiding Abelian fourth powers grows exponentially (Q596075) (← links)
- Avoiding Abelian squares in partial words (Q645980) (← links)
- Abelian repetitions in partial words (Q651057) (← links)
- Properties of integers and finiteness conditions for semigroups (Q689894) (← links)
- Problems in between words and abelian words: \(k\)-abelian avoidability (Q714821) (← links)
- Coloring factors of substitutive infinite words (Q729779) (← links)
- Branching frequency and Markov entropy of repetition-free languages (Q832956) (← links)
- A powerful abelian square-free substitution over 4 letters (Q837181) (← links)
- On abelian 2-avoidable binary patterns (Q877171) (← links)
- Thue type problems for graphs, points, and numbers (Q941381) (← links)
- A cyclic binary morphism avoiding abelian fourth powers (Q1001897) (← links)
- Collinear subsets of lattice point sequences -- an analog of Szemeredi's theorem (Q1137067) (← links)
- On Abelian squares and substitutions (Q1292481) (← links)
- On uniformly repetitive semigroups (Q1328454) (← links)
- On the number of Abelian square-free words on four letters (Q1382260) (← links)
- Repetitive perhaps, but certainly not boring (Q1583539) (← links)
- Anagram-free graph colouring (Q1753108) (← 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)
- Abelian repetition threshold revisited (Q2097234) (← links)
- Avoiding abelian powers cyclically (Q2221763) (← links)
- On highly palindromic words: the \(n\)-ary case (Q2231750) (← links)
- Avoiding 2-binomial squares and cubes (Q2257294) (← links)
- Chains and fixing blocks in irreducible binary sequences (Q2266018) (← links)
- On a generalization of Thue sequences (Q2346472) (← links)
- Long binary patterns are abelian 2-avoidable (Q2378523) (← links)
- Facial anagram-free edge-coloring of plane graphs (Q2399301) (← links)
- On growth and fluctuation of \(k\)-abelian complexity (Q2400973) (← links)
- The undirected repetition threshold and undirected pattern avoidance (Q2662683) (← links)
- On Abelian repetition threshold (Q2911433) (← links)
- Local Squares, Periodicity and Finite Automata (Q3003473) (← links)
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY (Q3016224) (← links)
- Anagram-Free Colourings of Graphs (Q3177364) (← links)
- Avoiding Three Consecutive Blocks of the Same Size and Same Sum (Q3189645) (← links)
- On Growth and Fluctuation of k-Abelian Complexity (Q3194711) (← links)
- Splitting necklaces and measurable colorings of the real line (Q3625532) (← links)
- Avoiding or Limiting Regularities in Words (Q4613549) (← links)
- ALGORITHMIC COMBINATORICS ON PARTIAL WORDS (Q4923275) (← links)
- Avoidability of Additive Cubes over Alphabets of Four Numbers (Q5041260) (← links)
- (Q5089254) (← links)
- Abelian squares are avoidable on 4 letters (Q5204304) (← links)
- Avoidability of long 𝑘-abelian repetitions (Q5741503) (← links)
