Restricted Dumont permutations, Dyck paths, and noncrossing partitions
Alexander Burstein, Sergi Elizalde, Toufik Mansour
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.
Create a lesson
Related papers
On Unavoidable Faces of High-Dimensional Polytopes
Jesús A. De Loera, Ethan X. Fang, Shengtao Guo et al.
Graphs with Long Pseudosimilarity Chains under Consecutive Vertex Deletions
Sergey Ivanov
List coloring C3-free planar graphs with a sparse matching of restricted lists
Stephen G. Hartke, Yupei Li, Joseph Pappe et al.
On the gonality of Kneser graphs
Luis A. Ballinas, Willoughby Caine, D. Blake Hopkins et al.
Localization of the Caro-Wei bound and its applications to bipartiteness
Aida Abiad, Hitesh Kumar, Shivaramakrishna Pragada
Varieties of chain complexes and mixed dimer covers
Portia X. Anderson, Esther Banaian, Melanie J. Ferreri et al.