Further applications of a power series method for pattern avoidance

zbMath1219.68128arXiv0907.4667MaRDI QIDQ547794

Narad Rampersad

Publication date: 24 June 2011

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

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

zbMATH Keywords

binary alphabet

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (8)

Doubled patterns are 3-avoidable ⋮ A short proof that shuffle squares are 7-avoidable ⋮ A General Framework for Hypergraph Coloring ⋮ Strict bounds for pattern avoidance ⋮ Application of entropy compression in pattern avoidance ⋮ Another approach to non-repetitive colorings of graphs of bounded degree ⋮ Lower-bounds on the growth of power-free languages over large alphabets ⋮ Compressibility and probabilistic proofs

This page was built for publication: Further applications of a power series method for pattern avoidance