no. 4 · Wednesday 28 October 2026
Log-concavity of longest increasing subsequence
Abstract
We prove a conjecture proposed by Chen that, for every fixed $n$, the sequence $(a_{n,k})_{k=1}^n$ is log-concave, where $a_{n,k}$ counts permutations of $[n]$ whose longest increasing subsequence has length $k$.
- comments
- 15 pages
- fields
- Combinatorics, Probability