Ranks of overpartitions: asymptotics and inequalities (Q2325968): Difference between revisions

In order to combinatorially explain the famous Ramanujan congruences mod\,5, 7 and 11 for the number \(p(n)\) of the partitions of \(n\), \textit{F. Dyson} [Eureka 8, 10--15 (1944)] defined the rank of a partition as the largest part minus the number of parts. An overpartition of \(n\) is a partition of \(n\) in which the first occurrence of a part may be overlined. In the paper under review, the author computes asymptotics for the ranks of overpartitions which result the asymptotic value \(e^{\pi\sqrt n}/(c8n)\) for \(\overline{N}(a,c,n)\), the number of overpartitions of \(n\) with rank congruent to a \(\bmod c\) with respect to \(0\le a<c\), for any \(c\ge 2\), as \(n\to\infty\). The author also proves some inequalities between ranks of overpartitions conjectured by \textit{K. Q. Ji} et al. [J. Number Theory 184, 235--269 (2018; Zbl 1420.11134)], resp. \textit{B. Wei} and \textit{H. W. J. Zhang} [``Generalized Lambert series identities and applications in rank differences'', Preprint, arXiv:1801.04643] for \(c=10\) resp. \(c=6\).