Classification of bijections between 321- and 132-avoiding permutations
From MaRDI portal
Publication:4584061
Recommendations
Cited in
(18)- Bijections for refined restricted permutations
- An infinite family of inv-Wilf-equivalent permutation pairs
- Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths
- Classification of bijections between 321- and 132-avoiding permutations
- On pattern avoiding indecomposable permutations
- Restricted permutations refined by number of crossings and nestings
- Refined Wilf-equivalences by Comtet statistics
- Equidistributions of Mahonian statistics over pattern avoiding permutations
- Counting pattern avoiding permutations by number of movable letters
- \(k\)-arrangements, statistics, and patterns
- Rationality for subclasses of 321-avoiding permutations
- A simple bijection between 312-avoiding permutations and triangulations
- On two bijections from \(S_{n}(321)\) to \(S_{n}(132)\).
- Fibonacci numbers, reduced decompositions, and 321/3412 pattern classes
- A natural bijection for contiguous pattern avoidance in words
- A refinement of Wilf-equivalence for patterns of length 4
- Combinatorial generation via permutation languages. I: Fundamentals
- Avoiding patterns and making the best choice
This page was built for publication: Classification of bijections between 321- and 132-avoiding permutations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4584061)