Eventual log-concavity of k-rank statistics for integer partitions
Abstract
Let Nk(m,n) denote the number of partitions of n with Garvan k-rank m. It is well-known that Andrews-Garvan-Dyson's crank and Dyson's rank are the k-rank for k=1 and k=2, respectively. In this paper, we prove that the sequence \Nk(m,n)\|m| n-k-71 is log-concave for all sufficiently large n and each integer k. In particular, we partially solve the log-concavity conjecture for Andrews-Garvan-Dyson's crank and Dyson's rank, which was independently proposed by Bringmann-Jennings-Shaffer-Mahlburg and Ji-Zang.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.