2000 character limit reached
Sums of class numbers and mixed mock modular forms
Published 1 May 2013 in math.NT | (1305.0112v2)
Abstract: In this paper, we consider sums of class numbers of the type $\sum_{m\equiv a\pmod{p}} H(4n-m2)$, where $p$ is an odd prime, $n\in \mathbb{N},$ and $a\in \mathbb{Z}$. By showing that these are coefficients of mixed mock modular forms, we obtain explicit formulas. Using these formulas for $p=5$ and $7$, we then prove a conjecture of Brown et al. in the case that $n=\ell$ is prime.
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.