arXiv Analytics

Sign in

arXiv:math/0609704 [math.CO]AbstractReferencesReviewsResources

Counting permutations by their runs up and down

E. Rodney Canfield, Herbert S. Wilf

Published 2006-09-25Version 1

We find a formula for the number of permutations of $[n]$ that have exactly $s$ runs up and down. The formula is at once terminating, asymptotic, and exact.

Comments: 12 pages
Categories: math.CO
Subjects: 05A15, 05A16
Related articles: Most relevant | Search more
arXiv:2012.13570 [math.CO] (Published 2020-12-25)
Asymptotics and statistics on Fishburn Matrices: dimension distribution and a conjecture of Stoimenow
arXiv:2407.07366 [math.CO] (Published 2024-07-10)
Counting Permutations in $S_{2n}$ and $S_{2n+1}$
arXiv:math/0303028 [math.CO] (Published 2003-03-03, updated 2003-03-16)
Equations in finite semigroups: Explicit enumeration and asymptotics of solution numbers

Links

Toolbox