论文信息 - A Combinatorial Proof of the Log-Concavity of a Famous Sequence Counting Permutations

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

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.

Miklós Bóna

[1] P. A. Macmahon,et al. The Indices of Permutations and the Derivation Therefrom of Functions of a Single Variable Associated with the Permutations of any Assemblage of Objects , 1913 .

[2] R. Stanley. Log‐Concave and Unimodal Sequences in Algebra, Combinatorics, and Geometry a , 1989 .