Hybrid subconvexity and the partition function
Nickolas Andersen, Han Wu

TL;DR
This paper establishes a new hybrid subconvexity bound for certain L-functions, leading to an improved upper bound on the error term in the partition function's Hardy-Ramanujan-Rademacher formula.
Contribution
It introduces a novel hybrid subconvexity bound for central L-values, enhancing the understanding of the partition function's error term.
Findings
Derived a new hybrid subconvexity bound for L(1/2,f×(q/·))
Improved the upper bound for the error term in the partition function
Enhanced the analytic understanding of the partition function's asymptotics
Abstract
We give an upper bound for the error term in the Hardy-Ramanujan-Rademacher formula for the partition function. The main input is a new hybrid subconvexity bound for the central value in the and spectral parameter aspects, where is a Hecke-Maass cusp form for and is a fundamental discriminant.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Inequalities and Applications · Analytic and geometric function theory · Analytic Number Theory Research
