2000 character limit reached
Asymptotic formula for the $M_2$-ranks of overpartitions
Published 5 Jun 2022 in math.CO and math.NT | (2206.02167v1)
Abstract: Let $\overline{N}_2(a,c,n)$ be the number of overpartitions of $n$ whose the $M_2$-rank is congruent to $a$ modulo $c$. In this paper, we obtain the asymptotic formula of $\overline{N}_2(a,c,n)$ utilizing the Ingham Tauberian Theorem. As applications, we derive inequalities concerning with $\overline{N}_2(a,c,n)$ including its strict concavity and log-concavity.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.