Classification of bijections between 321- and 132-avoiding permutations
From MaRDI portal
Publication:4584061
zbMATH Open1393.05010MaRDI QIDQ4584061FDOQ4584061
Authors: Anders Claesson, Sergey Kitaev 
Publication date: 29 August 2018
Full work available at URL: http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAJ0143
Recommendations
Cited In (18)
- Permutations weakly avoiding barred patterns and combinatorial bijections to generalized Dyck and Motzkin paths
- A natural bijection for contiguous pattern avoidance in words
- Bijections for refined restricted permutations
- Avoiding patterns and making the best choice
- Combinatorial generation via permutation languages. I: Fundamentals
- On pattern avoiding indecomposable permutations
- A simple bijection between 312-avoiding permutations and triangulations
- An infinite family of inv-Wilf-equivalent permutation pairs
- \(k\)-arrangements, statistics, and patterns
- Refined Wilf-equivalences by Comtet statistics
- Restricted permutations refined by number of crossings and nestings
- Equidistributions of Mahonian statistics over pattern avoiding permutations
- Counting pattern avoiding permutations by number of movable letters
- On two bijections from \(S_{n}(321)\) to \(S_{n}(132)\).
- Fibonacci numbers, reduced decompositions, and 321/3412 pattern classes
- A refinement of Wilf-equivalence for patterns of length 4
- Classification of bijections between 321- and 132-avoiding permutations
- Rationality for subclasses of 321-avoiding permutations
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)
