Precision Asymptotics for Partitions Featuring False-Indefinite Theta Functions
Kathrin Bringmann, William Craig, Caner Nazaroglu
TL;DR
This paper develops a circle-method framework around false-indefinite theta functions tied to Maass forms to study the asymptotics of Fourier coefficients arising from parity-separated partitions. By leveraging mock Maass theta theory, Mordell-type obstructions, and modular completions, the authors obtain a high-precision asymptotic expansion for the coefficients $\alpha_j(n)$, explicitly capturing all exponentially growing terms and enabling Hardy–Ramanujan–Rademacher-type formulas under suitable conditions. The results demonstrate detailed control over both principal and non-principal contributions via the obstruction representation and circle integration, and they connect combinatorial partition data to the analytic structure of Maass forms. The methods are broad and suggest extensions to other modular-adjacent objects, with potential applications to exact formulas for weights where circle-method techniques yield convergent expansions. A key outcome is the explicit leading-exponential terms for $\alpha_j(n)$, expressed in terms of the local kernel data $\Phi_{\ell,0}$ and its derivatives at $t=0$, anchoring the asymptotics in the local analytic structure of the associated false-indefinite theta functions.
Abstract
Andrews-Dyson-Hickerson, Cohen build a striking relation between q-hypergeometric series, real quadratic fields, and Maass forms. Thanks to the works of Lewis-Zagier and Zwegers we have a complete understanding on the part of these relations pertaining to Maass forms and false-indefinite theta functions. In particular, we can systematically distinguish and study the class of false-indefinite theta functions related to Maass forms. A crucial component here is the framework of mock Maass theta functions built by Zwegers in analogy with his earlier work on indefinite theta functions and their application to Ramanujan's mock theta functions. Given this understanding, a natural question is to what extent one can utilize modular properties to investigate the asymptotic behavior of the associated Fourier coefficients, especially in view of their relevance to combinatorial objects. In this paper, we develop the relevant methods to study such a question and show that quite detailed results can be obtained on the asymptotic development, which also enable Hardy-Ramanujan-Rademacher type exact formulas under the right conditions. We develop these techniques by concentrating on a concrete example involving partitions with parts separated by parity and derive an asymptotic expansion that includes all the exponentially growing terms.
