Title of article
Counting permutations by their alternating runs
Author/Authors
Canfield، نويسنده , , E. Rodney and Wilf، نويسنده , , Herbert S.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2008
Pages
13
From page
213
To page
225
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 / log n ( ϵ > 0 ).
Keywords
Alternating runs , Increasing and decreasing subsequences , Permutations , Asymptotic series , Exact formula
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2008
Journal title
Journal of Combinatorial Theory Series A
Record number
1531267
Link To Document