Asymptotic Formulas Related to the $M_2$-rank of Partitions without Repeated Odd Parts
Chris Jennings-Shaffer, Dillon Reihill

TL;DR
This paper derives asymptotic formulas for the moments and values of the $M_2$-rank generating function for partitions without repeated odd parts, using the Hardy-Ramanujan circle method extended to mock modular forms, and resolves some conjectured inequalities.
Contribution
It extends the Hardy-Ramanujan circle method to mock modular forms to obtain asymptotics for the $M_2$-rank and related partition counts, resolving conjectured inequalities.
Findings
Asymptotic expansions for $M_2$-rank moments
Asymptotics for $M_2$-rank at roots of unity
Resolution of conjectured inequalities by Mao
Abstract
We give asymptotic expansions for the moments of the -rank generating function and for the -rank generating function at roots of unity. For this we apply the Hardy-Ramanujan circle method extended to mock modular forms. Our formulas for the -rank at roots of unity lead to asymptotics for certain combinations of (the number of partitions without repeated odd parts of with -rank congruent to modulo ). This allows us to deduce inequalities among certain combinations of . In particular, we resolve a few conjectured inequalities of Mao.
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.
