Enumeration of Dumont permutations avoiding certain four-letter patterns

zbMath1487.05009arXiv2002.12189MaRDI QIDQ5074772

Alexander Burstein, Opel Jones

Publication date: 10 May 2022

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

zbMATH Keywords

pattern avoidancepermutation patternDumont permutation

Mathematics Subject Classification ID

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

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A short proof for the number of permutations containing pattern 321 exactly once
• The enumeration of permutations with a prescribed number of ``forbidden patterns
• Restricted Dumont permutations, Dyck paths, and noncrossing partitions
• Interpretations combinatoires des nombres de Genocchi
• Permutation patterns and continued fractions
• Generalized permutation patterns and a classification of the Mahonian statistics
• The number of permutations containing exactly one increasing subsequence of length three
• The On-Line Encyclopedia of Integer Sequences
• Classifying descents according to parity
• Classifying descents according to equivalence \(\operatorname{mod} k\)
• Restricted Dumont permutations
• Une propriété de symétrie des nombres de Genocchi
• On the Netto Inversion Number of a Sequence
• Restricted permutations
• Permutations with restricted patterns and Dyck paths

This page was built for publication: Enumeration of Dumont permutations avoiding certain four-letter patterns