Doubled patterns are 3-avoidable

zbMath1335.68191arXiv1510.01753MaRDI QIDQ2635083

Pascal Ochem

Publication date: 11 February 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.01753

zbMATH Keywords

pattern avoidance

Mathematics Subject Classification ID

68R15: Combinatorics on words

Related Items

Avoiding or Limiting Regularities in Words, A General Framework for Hypergraph Coloring, How far away must forced letters be so that squares are still avoidable?, On some interesting ternary formulas, Nonrepetitive and pattern-free colorings of the plane, Grasshopper avoidance of patterns, Avoidability of formulas with two variables, Avoidability of circular formulas, Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols, Doubled patterns with reversal are 3-avoidable, Another approach to non-repetitive colorings of graphs of bounded degree, Avoidability of palindrome patterns, Lower-bounds on the growth of power-free languages over large alphabets, Doubled patterns with reversal and square-free doubled patterns, Avoidability of Formulas with Two Variables, A short proof that shuffle squares are 7-avoidable

Cites Work

• Unnamed Item
• Strict bounds for pattern avoidance
• Application of entropy compression in pattern avoidance
• Further applications of a power series method for pattern avoidance
• On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters
• Growth problems for avoidable words
• Avoidable patterns in strings of symbols
• Exponential lower bounds for the number of words of uniform length avoiding a pattern
• A generator of morphisms for infinite words
• BLOCKING SETS OF TERMS
• Twistor spaces and harmonic maps
• Two notes on subshifts