Generalized pattern avoidance with additional restrictions
From MaRDI portal
Abstract: Babson and Steingr'{i}msson introduced generalized permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We consider n-permutations that avoid the generalized pattern 1-32 and whose k rightmost letters form an increasing subword. The number of such permutations is a linear combination of Bell numbers. We find a bijection between these permutations and all partitions of an -element set with one subset marked that satisfy certain additional conditions. Also we find the e.g.f. for the number of permutations that avoid a generalized 3-pattern with no dashes and whose k leftmost or k rightmost letters form either an increasing or decreasing subword. Moreover, we find a bijection between n-permutations that avoid the pattern 132 and begin with the pattern 12 and increasing rooted trimmed trees with n+1 nodes.
Recommendations
Cited in
(6)- Multi-avoidance of generalised patterns
- Multiple pattern avoidance with respect to fixed points and excedances
- Joint distributions of permutation statistics and the parabolic cylinder functions
- scientific article; zbMATH DE number 2192093 (Why is no real title available?)
- scientific article; zbMATH DE number 2192219 (Why is no real title available?)
- Generalized pattern avoidance
This page was built for publication: Generalized pattern avoidance with additional restrictions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1423006)