Restricted Dumont permutations, Dyck paths, and noncrossing partitions
From MaRDI portal
(Redirected from Publication:860451)
Abstract: We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some combinatorial statistics on Dumont permutations avoiding certain patterns of length 3 and 4 and give a natural bijection between 3142-avoiding Dumont permutations of the second kind and noncrossing partitions that uses cycle decomposition, as well as bijections between 132-, 231- and 321-avoiding Dumont permutations and Dyck paths. Finally, we enumerate Dumont permutations of the first kind simultaneously avoiding certain pairs of 4-letter patterns and another pattern of arbitrary length.
Recommendations
- Restricted Dumont permutations
- A simple and unusual bijection for Dyck paths and its consequences
- Enumeration of Dumont permutations avoiding certain four-letter patterns
- Dyck paths and restricted permutations
- Two permutation classes enumerated by the central binomial coefficients
- New Dumont permutations
- scientific article; zbMATH DE number 2104721
- scientific article; zbMATH DE number 1042593
- On bijections between 231-avoiding permutations and Dyck paths
- scientific article; zbMATH DE number 6272293
Cites work
- scientific article; zbMATH DE number 2104721 (Why is no real title available?)
- scientific article; zbMATH DE number 2107707 (Why is no real title available?)
- scientific article; zbMATH DE number 758277 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- Asymptotic values for degrees associated with strips of Young diagrams
- Bijections for refined restricted permutations
- Classification of forbidden subsequences of length 4
- Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
- Forbidden subsequences
- Generating trees and forbidden subsequences
- Generating trees and the Catalan and Schröder numbers
- Interpretations combinatoires des nombres de Genocchi
- On the diagram of 132-avoiding permutations
- Permutation tableaux and permutation patterns
- Permutations with restricted patterns and Dyck paths
- Restricted Dumont permutations
- Restricted permutations
- Restricted permutations and Chebyshev polynomials
- Symmetric functions and P-recursiveness
Cited in
(16)- Ascending runs in permutations and valued Dyck paths
- Counting segmented permutations using bicoloured Dyck paths
- scientific article; zbMATH DE number 2104721 (Why is no real title available?)
- Separable \(d\)-permutations and guillotine partitions
- scientific article; zbMATH DE number 1042593 (Why is no real title available?)
- Enumeration of Dumont permutations avoiding certain four-letter patterns
- Several variants of the Dumont differential system and permutation statistics
- Combinatorial properties of Catalan pairs
- Pattern statistics in faro words and permutations
- Catalan pairs: a relational-theoretic approach to Catalan numbers
- A distributive lattice structure connecting Dyck paths, noncrossing partitions and 312-avoiding permutations
- Classical continued fractions for some multivariate polynomials generalizing the Genocchi and median Genocchi numbers
- Restricted Motzkin permutations, Motzkin paths, continued fractions, and Chebyshev polyno\-mials
- Restricted Dumont permutations
- scientific article; zbMATH DE number 7666236 (Why is no real title available?)
- New Dumont permutations
This page was built for publication: Restricted Dumont permutations, Dyck paths, and noncrossing partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q860451)
