Dyson's ranks and Appell-Lerch sums

From MaRDI portal
Publication:514353

DOI10.1007/S00208-016-1390-5zbMATH Open1367.11077arXiv1309.1562OpenAlexW1961030314MaRDI QIDQ514353FDOQ514353


Authors: Dean R. Hickerson, Eric T. Mortenson Edit this on Wikidata


Publication date: 1 March 2017

Published in: Mathematische Annalen (Search for Journal in Brave)

Abstract: Denote by p(n) the number of partitions of n and by N(a,M;n) the number of partitions of n with rank congruent to a modulo M. We find and prove a general formula for Dyson's ranks by considering the deviation of the ranks from the average: �egin{equation*} D(a,M) := sum_{n= 0}^{infty}left(N(a,M;n) - frac{p(n)}{M} ight) q^n. end{equation*} Using Appell--Lerch sum properties we decompose D(a,M) into modular and mock modular parts so that the mock modular component is supported on certain arithmetic progressions, whose modulus we can control. Using our decomposition, we show how our formula gives as a straightforward consequence Atkin and Swinnerton-Dyer's results on ranks as well as Bringmann, Ono, and Rhoades's results on Maass forms. We also apply our techniques to a variation of Dyson's ranks due to Berkovitch and Garvan.


Full work available at URL: https://arxiv.org/abs/1309.1562




Recommendations




Cites Work


Cited In (26)





This page was built for publication: Dyson's ranks and Appell-Lerch sums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q514353)