| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4656261 | Journal of Combinatorial Theory, Series A | 2008 | 13 Pages |
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. The asymptotic series is valid for n→∞, uniformly for s⩽(1−ϵ)n/logn (ϵ>0).
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
