Answers are grounded in this paper and cite their sources.
Proves an asymptotic formula for Fourier coefficients in partitions, suggesting avenues for Dyson's conjectures.
In 2009, Bringmann [Trans. Amer. Math. Soc. 361 (2009), pp. 3483–3500] used the circle method to prove an asymptotic formula for the Fourier coefficients of rank generating functions. In this paper, we prove that Bringmann’s formula, when summing up to infinity and in the case of prime modulus, gives a Rademacher-type exact formula involving sums of vector-valued Kloosterman sums. As a corollary, in another paper [Ramanujan J. 66 (2025)], we will provide a new proof of Dyson’s conjectures by showing that the certain Kloosterman sums vanish.
No takes yet. Share an insight, caveat, or question.
Qihang Sun (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: