A combinatorial proof of the log-concavity of a famous sequence counting permutations

zbMath1067.05002MaRDI QIDQ1773144

Miklós Bóna

Publication date: 25 April 2005

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/124878

zbMATH Keywords

log-concavityinversion number of permutationsnon-generating function proof

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05)

Related Items (6)

Formation of a giant component in the intersection graph of a random chord diagram ⋮ On the connected components of a random permutation graph with a given number of edges ⋮ Lattice paths and \((n - 2)\)-stack sortable permutations ⋮ An analogue of Mahonian numbers and log-concavity ⋮ Symmetry and log-concavity results for statistics on Fibonacci tableaux ⋮ Log-concavity of the partition function

This page was built for publication: A combinatorial proof of the log-concavity of a famous sequence counting permutations