arXiv Analytics

Sign in

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"

Related articles: Most relevant | Search more
arXiv:1206.0320 [math.CO] (Published 2012-06-01, updated 2012-07-12)
Expected Patterns in Permutation Classes
arXiv:0906.4290 [math.CO] (Published 2009-06-23, updated 2010-01-13)
Asymptotics of partial sums of central binomial coefficients and Catalan numbers
arXiv:1803.08959 [math.CO] (Published 2018-03-23, updated 2020-02-27)
Enumerating two permutation classes by number of cycles