Inequalities for differences of Dyson's rank for all odd moduli (Q2275745)

Let \(N(a,c,n)\) denote the number of partitions of \(n\) with rank congruent to \(a\) modulo \(c\). The authors show that if \(c > 9\) is odd, then for \(0 \leq a < b \leq \frac{c-1}{2}\) there is an explicit constant \(N_{a,b,c}\) such that for all \(n > N_{a,b,c}\) we have \[ N(a,c,n) - N(b,c,n) > 0. \] (The symmetry \(N(a,c,n) = N(c-a,c,n)\) ensures that there is no loss of generality in the above restrictions on \(a\) and \(b\).) For \(c = 3\), \(5\), \(7\), or \(9\), the sign of \(N(a,c,n) - N(b,c,n)\) depends on \(a\) and \(b\) as well as the residue of \(n\) modulo \(3\), \(5\), \(7\), or \(3\), respectively. This was proven in some cases by the first author [Trans. Am. Math. Soc. 361, No. 7, 3483--3500 (2009; Zbl 1189.11049)], \textit{F.~G.~Garvan} [Combinatorial interpretations of Ramanujan's partition congruences, Ramanujan revisited, Proc. Conf., Urbana-Champaign/Illinois 1987, 29--45 (1988; Zbl 0652.10010)], and \textit{N.~Santa-Gadea} [J. Number Theory 40, No. 2, 130--145 (1992; Zbl 0747.11044)], and the present paper fills in the remaining cases. The proofs involve a careful analysis of previous results of the first author on asymptotics of rank generating functions.