pith. sign in

arxiv: 1301.1790 · v1 · pith:ENYNUZTNnew · submitted 2013-01-09 · 🧮 math.CO

Two permutation classes enumerated by the central binomial coefficients

classification 🧮 math.CO
keywords classeseitherelementnumberpermutationsallowsascentsavoid
0
0 comments X
read the original abstract

We define a map between the set of permutations that avoid either the four patterns $3214,3241,4213,4231$ or $3124,3142,4123,4132$, 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"

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.