arXiv:1301.1790 [math.CO]AbstractReferencesReviewsResources
Two permutation classes enumerated by the central binomial coefficients
Marilena Barnabei, Flavio Bonetti, Matteo Silimbani
Published 2013-01-09Version 1
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"
Comments: 26 pages, 3 figures
Categories: math.CO
Related articles: Most relevant | Search more
Expected Patterns in Permutation Classes
Asymptotics of partial sums of central binomial coefficients and Catalan numbers
Enumerating two permutation classes by number of cycles