Dyson’s ranks and Appell–Lerch sums

详细信息    查看全文

• 作者：Dean Hickerson ; Eric Mortenson
• 关键词：Mathematics Subject Classification11P84 ; 11B65 ; 11F11 ; 11F27
• 刊名：Mathematische Annalen
• 出版年：2017
• 出版时间：February 2017
• 年：2017
• 卷：367
• 期：1-2
• 页码：373-395
• 全文大小：
• 刊物类别：Mathematics and Statistics
• 刊物主题：Mathematics, general;
• 出版者：Springer Berlin Heidelberg
• ISSN：1432-1807
• 卷排序：367

文摘

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: $$\begin{aligned} D(a,M) := \sum _{n= 0}^{\infty }\left( N(a,M;n) - \frac{p(n)}{M}\right) q^n. \end{aligned}$$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 celebrated work of Bringmann, Ono, and Rhoades’s on Maass forms. We also give an example of how our methods apply to work of Lovejoy and Osburn on rank differences.Mathematics Subject Classification11P8411B6511F1111F27For Freeman Dyson in honour of his 90th birthday.