Permutations of a multiset avoiding permutations of length 3 (Q5952148)

A sequence of numbers \(\alpha =(a_{1},\dots ,a_{m})\) is contained in a sequence of numbers \(\beta =(b_{1},\dots ,b_{n})\) if there is a subsequence \((b_{i_{1}},\dots,b_{i_{m}})\), \(i_{1}<\dots <i_{m},\) so that \(a_{s}\leq a_{t}\) iff \(b_{i_{s}}\leq b_{i_{t}}.\) In the paper the permutations of a multiset which do not contain certain subsequences of length \(3\) are considered, in many cases an enumeration of such permutations is given.