2000 character limit reached
Approximate Atkin-Serre Conjecture (2104.04410v3)
Published 9 Apr 2021 in math.GM
Abstract: Let $\lambda(m)$ be the $m$th coefficient of a modular form $f(z)=\sum_{m\geq 1} \lambda(m)qm$ of weight $k\geq 4$, let $pn$ be a prime power, and let $\varepsilon>0$ be a small number. An approximate of the Atkin-Serre conjecture on the lower bound of the form $\left |\lambda\left (pn\right )\right | \geq p{(k-1)n/2-2k+2\varepsilon}$ is presented in this note.
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.