2000 character limit reached
Eventual log-concavity of $k$-rank statistics for integer partitions
Published 21 Oct 2021 in math.NT and math.CO | (2110.11174v3)
Abstract: Let $N_k(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 ${N_k(m,n)}_{|m|\le 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.