Counting permutations by their runs up and down

Abstract

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.

12 pages

References in corpus (1)

• The number of permutations with a given number of sequences