2000 character limit reached
Asymptotic Formulas Related to the $M_2$-rank of Partitions without Repeated Odd Parts (1805.11319v3)
Published 29 May 2018 in math.NT
Abstract: We give asymptotic expansions for the moments of the $M_2$-rank generating function and for the $M_2$-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 $M_2$-rank at roots of unity lead to asymptotics for certain combinations of $N2(r,m,n)$ (the number of partitions without repeated odd parts of $n$ with $M_2$-rank congruent to $r$ modulo $m$). This allows us to deduce inequalities among certain combinations of $N2(r,m,n)$. In particular, we resolve a few conjectured inequalities of Mao.