| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4625329 | Advances in Applied Mathematics | 2006 | 19 Pages |
Abstract
We find generating functions for the number of compositions avoiding a single pattern or a pair of patterns of length three on the alphabet {1,2} and determine which of them are Wilf-equivalent on compositions. We also derive the number of permutations of a multiset which avoid these same patterns and determine the Wilf-equivalence of these patterns on permutations of multisets.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
