Exact formula for 1-lower run overpartitions
Lukas Mauth

TL;DR
This paper derives an exact formula for 1-lower run overpartitions, revealing its generating function as a mixed mock-modular form and employing an extended Circle Method with advanced bounds.
Contribution
It introduces a novel exact formula for 1-lower run overpartitions and applies an extended Circle Method to analyze its mixed mock-modular generating function.
Findings
Exact formula for 1-lower run overpartitions
Generating function identified as mixed mock-modular form
Application of extended Circle Method with bounds on Kloosterman sums
Abstract
We are going to show an exact formula for lower -run overpartitions. The generating function is of mixed mock-modular type with an overall weight We will apply an extended version of the classical Circle Method. The approach requires bounding modified Kloosterman sums and Mordell integrals.
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
TopicsAnalytic Number Theory Research · Advanced Mathematical Identities · Polynomial and algebraic computation
