Permutations of a multiset avoiding permutations of length 3 (Q5952148)
From MaRDI portal
scientific article; zbMATH DE number 1687771
Language | Label | Description | Also known as |
---|---|---|---|
English | Permutations of a multiset avoiding permutations of length 3 |
scientific article; zbMATH DE number 1687771 |
Statements
Permutations of a multiset avoiding permutations of length 3 (English)
0 references
24 June 2002
0 references
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.
0 references
forbidden
0 references
permutation
0 references
multiset
0 references
enumeration
0 references
0 references