Two permutation classes enumerated by the central binomial coefficients
From MaRDI portal
Abstract: We define a map between the set of permutations that avoid either the four patterns or , and the set of Dyck prefixes. This map, when restricted to either of the two classes, turns out to be a bijection that allows us to determine some notable features of these permutations, such as the distribution of the statistics "number of ascents", "number of left-to-right maxima", "first element", and "position of the maximum element"
Recommendations
Cited in
(5)- Enumerating two permutation classes by the number of cycles
- Nine classes of permutations enumerated by binomial transform of Fine's sequence
- A complete enumeration of Ballot permutations avoiding sets of small patterns
- Restricted Dumont permutations, Dyck paths, and noncrossing partitions
- Juxtaposing Catalan permutation classes with monotone ones
This page was built for publication: Two permutation classes enumerated by the central binomial coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404305)