Asymptotic equidistribution and convexity for partition ranks (Q829696): Difference between revisions

In [in: Ramanujan revisited, Proc. Conf., Urbana-Champaign/Illinois 1987, 7--28 (1988; Zbl 0652.10009)], \textit{F. J. Dyson} defined the rank of an integer partition to be its largest part minus its number of parts. The number of partitions of \(n\) with rank congruent to \(r\) modulo \(t\) is denoted by \(N(r,t;n)\). In this paper, the author investigates the partition rank function \(N(r,t;n)\) and proves a conjecture of \textit{E. Hou} and \textit{M. Jagadeesan} [Ramanujan J. 45, No. 3, 817--839 (2018; Zbl 1459.11206)] on the convexity of \(N(r, t; n)\): For \(0 \leq r < t\) and \(t \geq 2\) then \[N(r, t; a)N(r, t; b) > N(r, t; a + b)\] for sufficiently large \(a\) and \(n\).