A combinatorial proof of the log-concavity of a famous sequence counting permutations
type: Item
instance of: scholarly article
title: A combinatorial proof of the log-concavity of a famous sequence counting permutations
zbMATH Open document ID: 1067.05002
author: Miklós Bóna
published in: The Electronic Journal of Combinatorics
publication date: 2005-04-25T00:00:00Z
full work available at URL: https://eudml.org/doc/124878
review text: 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\).
reviewed by: Astrid Reifegerste
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05A15
zbMATH DE Number: 2161260
zbMATH Keywords: log-concavity
zbMATH Keywords: inversion number of permutations
zbMATH Keywords: non-generating function proof
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 2161260