A Combinatorial Proof of the Log-Concavity of the Numbers of Permutations with k Runs

Miklós Bóna, Richard Ehrenborg

Research output: Contribution to journalArticlepeer-review

21 Scopus citations

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 languageEnglish
Pages (from-to)293-303
Number of pages11
JournalJournal of Combinatorial Theory. Series A
Volume90
Issue number2
DOIs
StatePublished - 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.

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