Abstract
We combinatorially prove that the number R(n, k) of permutations of length n having k runs is a log-concave sequence in k, for all n. We also give a new combinatorial proof for the log-concavity of the Eulerian numbers.
| Original language | English |
|---|---|
| Pages (from-to) | 293-303 |
| Number of pages | 11 |
| Journal | Journal of Combinatorial Theory. Series A |
| Volume | 90 |
| Issue number | 2 |
| DOIs | |
| State | Published - May 2000 |
Bibliographical note
Funding Information:1The paper was written while the author’s stay at IAS was supported by Trustee Ladislaus von Hoffmann, the Arcana Foundation. 2 Supported by National Science Foundation, DMS 97-29992, and NEC Research Institute, Inc.
Funding
1The paper was written while the author’s stay at IAS was supported by Trustee Ladislaus von Hoffmann, the Arcana Foundation. 2 Supported by National Science Foundation, DMS 97-29992, and NEC Research Institute, Inc.
| Funders | Funder number |
|---|---|
| Arcana Foundation | |
| Trustee Ladislaus von Hoffmann | |
| National Science Foundation (NSF) | DMS 97-29992 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
Fingerprint
Dive into the research topics of 'A Combinatorial Proof of the Log-Concavity of the Numbers of Permutations with k Runs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver