中文

Counting permutations by their runs up and down

组合数学 2007-05-23 v1

摘要

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

关键词

引用

@article{arxiv.math/0609704,
  title  = {Counting permutations by their runs up and down},
  author = {E. Rodney Canfield and Herbert S. Wilf},
  journal= {arXiv preprint arXiv:math/0609704},
  year   = {2007}
}

备注

12 pages