Words Restricted by Patterns with at Most 2 Distinct Letters

  • Alexander Burstein
  • Toufik Mansour
DOI: https://doi.org/10.37236/1675

Abstract

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

Published
2002-10-31
How to Cite
Burstein, A., & Mansour, T. (2002). Words Restricted by Patterns with at Most 2 Distinct Letters. The Electronic Journal of Combinatorics, 9(2), R3. https://doi.org/10.37236/1675
Issue
Volume 9, Issue 2 (2002-3) (Permutation Patterns)
Article Number
R3