Restricted Dumont permutations, Dyck paths, and noncrossing partitions

DOI10.1016/j.disc.2006.05.031zbMath1111.05002arXivmath/0610234OpenAlexW2020861597MaRDI QIDQ860451

Toufik Mansour, Alexander Burstein, Sergi Elizalde

Publication date: 9 January 2007

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

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

zbMATH Keywords

enumerationforbidden patterns

Mathematics Subject Classification ID

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

Related Items

Catalan pairs: a relational-theoretic approach to Catalan numbers, Enumeration of Dumont permutations avoiding certain four-letter patterns, Pattern statistics in faro words and permutations, Combinatorial properties of Catalan pairs

Uses Software

• OEIS

Cites Work

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