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

Combinatorics on words (68R15)

Related Items (16)

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

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

This page was built for publication: Doubled patterns are 3-avoidable