A combinatorial proof of the log-concavity of a famous sequence counting permutations.
The Electronic Journal of Combinatorics [electronic only] (2004)
- Volume: 11, Issue: 2, page Research paper N2, 4 p., electronic only-Research paper N2, 4 p., electronic only
- ISSN: 1077-8926
Access Full Article
top
How to cite
topBóna, Miklós. "A combinatorial proof of the log-concavity of a famous sequence counting permutations.." The Electronic Journal of Combinatorics [electronic only] 11.2 (2004): Research paper N2, 4 p., electronic only-Research paper N2, 4 p., electronic only. <http://eudml.org/doc/124878>.
@article{Bóna2004,
author = {Bóna, Miklós},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {log-concavity; inversion number of permutations; non-generating function proof},
language = {eng},
number = {2},
pages = {Research paper N2, 4 p., electronic only-Research paper N2, 4 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {A combinatorial proof of the log-concavity of a famous sequence counting permutations.},
url = {http://eudml.org/doc/124878},
volume = {11},
year = {2004},
}
TY - JOUR
AU - Bóna, Miklós
TI - A combinatorial proof of the log-concavity of a famous sequence counting permutations.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2004
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 11
IS - 2
SP - Research paper N2, 4 p., electronic only
EP - Research paper N2, 4 p., electronic only
LA - eng
KW - log-concavity; inversion number of permutations; non-generating function proof
UR - http://eudml.org/doc/124878
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.