Abstrakt
In this paper, we study the Wilf-type equivalence relations among multiset permutations. We identify all multiset equivalences among pairs of patterns consisting of a pattern of length three and another pattern of length at most four.
To establish our results, we make use of a variety of techniques, including Ferrers-equivalence arguments, sorting by minimal/maximal letters, analysis of active sites and direct bijections. In several cases, our arguments may be extended to prove multiset equivalences for infinite families of pattern pairs.
Our results apply equally well to the Wilf-type classification of compositions, and as a consequence, we obtain a complete description of the Wilf-equivalence classes for pairs of patterns of type (3, 3) and (3, 4) on compositions, with the possible exception of two classes of type (3, 4).