A combinatorial proof of the log-concavity of a famous sequence counting permutations (Q1773144)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A combinatorial proof of the log-concavity of a famous sequence counting permutations |
scientific article; zbMATH DE number 2161260
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A combinatorial proof of the log-concavity of a famous sequence counting permutations |
scientific article; zbMATH DE number 2161260 |
Statements
A combinatorial proof of the log-concavity of a famous sequence counting permutations (English)
0 references
25 April 2005
0 references
The author proves combinatorially that the sequence \((i(n,k))_{0\leq k\leq{n\choose 2}}\) of the numbers of permutations of length \(n\) with \(k\) inversions is log-concave for any \(n\).
0 references
log-concavity
0 references
inversion number of permutations
0 references
non-generating function proof
0 references
