A new class of multiset Wilf equivalent pairs

We say the pair of patterns (σ,τ) is multiset Wilf equivalent if, for any multiset M, the number of permutations of M that avoid σ is equal to the number of permutations of M that avoid τ. In this paper, we find a large new class of multiset Wilf equivalent pairs, namely, the pair (σ_n-2(n-1)n, σ_n-2n(n-1)), for n?3 and σ_n-2 a permutation of {1^x₁,2^x₂,…,(n-2)^x_n-2}. It is the most general multiset Wilf equivalence result to date.