Resumen
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.
| Idioma original | English |
|---|---|
| Páginas (desde-hasta) | 293-303 |
| Número de páginas | 11 |
| Publicación | Journal of Combinatorial Theory. Series A |
| Volumen | 90 |
| N.º | 2 |
| DOI | |
| Estado | Published - may 2000 |
Nota bibliográfica
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.
Financiación
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.
| Financiadores | Número del financiador |
|---|---|
| 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
Huella
Profundice en los temas de investigación de 'A Combinatorial Proof of the Log-Concavity of the Numbers of Permutations with k Runs'. En conjunto forman una huella única.Citar esto
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver