A combinatorial proof of strict unimodality for -binomial coefficients
arXiv:1402.1199
Abstract
Pak and Panova recently proved that the -binomial coefficient is a strictly unimodal polynomial in for , via the representation theory of the symmetric group. We give a direct combinatorial proof of their result by characterizing when a product of chains is strictly unimodal and then applying O'Hara's structure theorem for the partition lattice . In fact, we prove a stronger result: if , and , then the -th rank of has at least more elements that the next lower rank.
7 pages, expanded results