Words restricted by patterns with at most 2 distinct letters

2001/10/04 by Alexander Burstein, Burstein, Alexander, Toufik Mansour +1
Mathematics · #05A05 #05A15 #Combinatorics (math.CO) #FOS: Mathematics #math.CO #msc:05A05 #msc:05A15

paper · pdf · doi:10.48550/arxiv.math/0110056

15 pages, LaTeX2e

arxiv created 2001/10/04 · arxiv updated 2009/11/30

Abstract

We find generating functions for the number of words avoiding certain patterns or sets of patterns on at most 2 distinct letters and determine which of them are equally avoided. We also find the exact number of words avoiding certain patterns and provide bijective proofs for the resulting formulas.

Related

• Words restricted by 3-letter generalized multipermutation patterns
• Finite automata and pattern avoidance in words
• Avoidable words
• Enumeration of some classes of words avoiding two generalized patterns of length three
• Two bijections for sets of words with forbidden factors