A Combinatorial Proof of the Log-Concavity of a Famous Sequence Counting Permutations

  • Miklós Bóna
DOI: https://doi.org/10.37236/1889

Abstract

We provide a combinatorial proof for the fact that for any fixed $n$, the sequence $\{i(n,k)\}_{0\leq k\leq {n\choose 2}}$ of the numbers of permutations of length $n$ having $k$ inversions is log-concave.

Published
2005-01-24
How to Cite
Bóna, M. (2005). A Combinatorial Proof of the Log-Concavity of a Famous Sequence Counting Permutations. The Electronic Journal of Combinatorics, 11(2), N2. https://doi.org/10.37236/1889
Issue
Volume 11, Issue 2 (2004-6) (The Stanley Festschrift volume)
Article Number
N2