Permutations containing and avoiding certain patterns

From MaRDI portal





A permutation \(\alpha \in S_n\) contains (avoids) a permutation \(\beta \in S_m\) if there is (no) \(1\leq i_1<\dots <i_m\leq n\) so that \((\alpha _{i_1},\dots,\alpha_{i_n})\) is order isomorphic to \(\beta =(\beta _1,\dots ,\beta _m).\) Let \(T_k^m\) be the set of all permutations \(\tau \in S_k,\) where \(\tau _1=m.\) The author determines, for \(k\leq n,\) the number of permutations which avoid all permutations in \(T_k^m\) and, for any \(\tau \in T_k^m\), determines the number of permutations which avoid all permutation in \(T_k^m-\tau \) and contain the permutation \(\tau \) exactly once. For the entire collection see [Zbl 0941.00013].











This page was built for publication: Permutations containing and avoiding certain patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4502592)