Restricted Dumont permutations, Dyck paths, and noncrossing partitions

DOI10.1016/J.DISC.2006.05.031zbMATH Open1111.05002arXivmath/0610234OpenAlexW2020861597MaRDI QIDQ860451FDOQ860451

Toufik Mansour, Alexander Burstein, Sergi Elizalde

Publication date: 9 January 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/math/0610234

zbMATH Keywords

enumerationforbidden patterns

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Restricted permutations
• Bijections for refined restricted permutations
• Symmetric functions and P-recursiveness
• Permutations with restricted patterns and Dyck paths
• Asymptotic values for degrees associated with strips of Young diagrams
• Restricted permutations and Chebyshev polynomials
• Generating trees and the Catalan and Schröder numbers
• Forbidden subsequences
• Generating trees and forbidden subsequences
• Permutation tableaux and permutation patterns
• Exact enumeration of 1342-avoiding permutations: A close link with labeled trees and planar maps
• Interpretations combinatoires des nombres de Genocchi
• Classification of forbidden subsequences of length 4
• On the diagram of 132-avoiding permutations
• Restricted Dumont permutations

Cited In (13)

• Counting segmented permutations using bicoloured Dyck paths
• Separable \(d\)-permutations and guillotine partitions
• Title not available (Why is that?)
• Enumeration of Dumont permutations avoiding certain four-letter patterns
• 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
• Title not available (Why is that?)
• Ascending runs in permutations and valued Dyck paths

Uses Software

• OEIS

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A simple and unusual bijection for Dyck paths and its consequences 👍 👎
• Dyck paths and restricted permutations 👍 👎
• On bijections between 231-avoiding permutations and Dyck paths 👍 👎
• Restricted Dumont permutations 👍 👎
• New Dumont permutations 👍 👎
• Enumeration of Dumont permutations avoiding certain four-letter patterns 👍 👎
• Two permutation classes enumerated by the central binomial coefficients 👍 👎

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)