Two permutation classes enumerated by the central binomial coefficients
Marilena Barnabei, Flavio Bonetti, and Matteo Silimbani

TL;DR
This paper establishes a bijection between two specific permutation classes avoiding certain patterns and Dyck prefixes, enabling detailed analysis of permutation statistics and their enumeration by central binomial coefficients.
Contribution
It introduces a novel bijection linking pattern-avoiding permutations to Dyck prefixes, facilitating enumeration and statistical analysis of these classes.
Findings
Permutation classes are enumerated by central binomial coefficients.
The distribution of key permutation statistics is characterized.
A new combinatorial bijection is constructed.
Abstract
We define a map between the set of permutations that avoid either the four patterns or , and the set of Dyck prefixes. This map, when restricted to either of the two classes, turns out to be a bijection that allows us to determine some notable features of these permutations, such as the distribution of the statistics "number of ascents", "number of left-to-right maxima", "first element", and "position of the maximum element"
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Coding theory and cryptography
