Abstract
It is well-known that the number of permutations of n letters that avoid a pattern τ of 3 letters is independent of τ. In this note we provide bijective proof that the same result holds for permutations of a multiset.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have