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.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献