A combinatorial proof of the log-concavity of the numbers of permutations with $k$ runs

Simple item page
dc.creatorBóna, Miklós
dc.creatorEhrenborg, Richard
dc.date1999-02-03
dc.date.accessioned2026-07-07T05:27:46Z
dc.date.available2026-07-07T05:27:46Z
dc.descriptionWe combinatorially prove that the number $R(n,k)$ of permutations of length $n$ having $k$ runs is a log-concave sequence in $k$, for all $n$. We also give a new combinatorial proof for the log-concavity of the Eulerian numbers.
dc.description10 pages, 4 figures
dc.identifierhttps://arxiv.org/abs/math/9902020
dc.identifierhttp://arxiv.org/abs/math/9902020
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/78046
dc.subjectCombinatorics
dc.subjectO5A15
dc.titleA combinatorial proof of the log-concavity of the numbers of permutations with $k$ runs
dc.typetext

Files

Collections

arXiv