A combinatorial proof of the log-concavity of a famous sequence counting permutations (Q1773144): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 04:39, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A combinatorial proof of the log-concavity of a famous sequence counting permutations |
scientific article |
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
