The descent statistic on involutions is not log-concave

Simple item page
dc.creatorBarnabei, Marilena
dc.creatorBonetti, Flavio
dc.creatorSilimbani, Matteo
dc.date2007-04-26
dc.date2008-03-14
dc.date.accessioned2026-07-07T09:26:28Z
dc.date.available2026-07-07T09:26:28Z
dc.descriptionWe establish a combinatorial connection between the sequence $(i_{n,k})$ counting the involutions on $n$ letters with $k$ descents and the sequence $(a_{n,k})$ enumerating the semistandard Young tableaux on $n$ cells with $k$ symbols. This allows us to show that the sequences $(i_{n,k})$ are not log-concave for some values of $n$, hence answering a conjecture due to F. Brenti.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/0704.3509
dc.identifierhttp://arxiv.org/abs/0704.3509
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/156763
dc.subjectCombinatorics
dc.subject05A05; 05A15; 05A19; 05E10
dc.titleThe descent statistic on involutions is not log-concave
dc.typetext

Files

Collections

arXiv