Oscillating asymptotics and conjectures of Andrews
Abstract
In 1986, Andrews studied the function from Ramanujan's ``Lost" Notebook, and made several conjectures on its Fourier coefficients , which count certain partition ranks. In 1988, Andrews-Dyson-Hickerson famously resolved these conjectures, relating the coefficients to the arithmetic of ; this relationship was further expounded upon by Cohen in his work on Maass waveforms, and was more recently extended by Zwegers and by Li and Roehrig. A closer inspection of Andrews' original work on reveals additional related functions and conjectures, which we study in this paper. In particular, we study the function , also from Ramanujan's ``Lost" Notebook, a -hypergeometric series with partition-theoretic Fourier coefficients , and prove two of Andrews' conjectures on which are parallel to his original conjectures on . Our methods differ from those used by Andrews-Dyson-Hickerson, and require a blend of novel techniques inspired by Garoufalidis' and Zagier's recent work on asymptotics of Nahm sums, with classical techniques including the Circle Method in Analytic Number Theory; our methods may also be applied to determine the asymptotic behavior of similar -hypergeometric series of interest which are not amenable to classical techniques. We also offer explanations of additional related conjectures of Andrews, ultimately connecting the asymptotics of to the arithmetic of .
Keywords
Cite
@article{arxiv.2305.16654,
title = {Oscillating asymptotics and conjectures of Andrews},
author = {Amanda Folsom and Joshua Males and Larry Rolen and Matthias Storzer},
journal= {arXiv preprint arXiv:2305.16654},
year = {2026}
}
Comments
36 pages, 6 figures. This updates the previous version. To appear in: Mathematische Annalen