2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/156763We 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.10 pagesCombinatorics05A05; 05A15; 05A19; 05E10text