Refined restricted permutations avoiding subsets of patterns of length three
From MaRDI portal
Abstract: Define to be the set of permutations of with exactly fixed points which avoid all patterns in . We enumerate , , for all and .
Recommendations
Cited in
(14)- Refined restricted permutations
- Restricted 1-3-2 permutations and generalized patterns
- Pattern avoidance for alternating permutations and Young tableaux
- Encoding labelled \(p\)-Riordan graphs by words and pattern-avoiding permutations
- Consecutive up-down patterns in up-down permutations
- Distributions of statistics over pattern-avoiding permutations
- Crossings over permutations avoiding some pairs of patterns of length three
- scientific article; zbMATH DE number 2188398 (Why is no real title available?)
- Permutations restricted by two distinct patterns of length three
- Fixed points and excedances in restricted permutations
- Desarrangements revisited: statistics and pattern avoidance
- Pattern avoidance in flattened derangements
- Title not available (Why is no real title available?)
- Refined restricted involutions
This page was built for publication: Refined restricted permutations avoiding subsets of patterns of length three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1400792)