Timeline for mod p modular forms
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 28, 2017 at 0:27 | answer | added | paul Monsky | timeline score: 3 | |
| Mar 6, 2017 at 23:02 | comment | added | Kimball | @FelipeVoloch I interpreted the question as asking how to show a specific $a_n$ (which I guess one can't compute?) is non-zero mod $p$. The OP should clarify the question. | |
| Mar 6, 2017 at 20:31 | comment | added | Felipe Voloch | There is an upper bound, say N, on the number of zeros counted with multiplicity, which works in char p which depends on the weight (and level if you are not just talking about level one). So, if the first N+1 coefficients are divisible by a prime p, the form has too high a zero at the cusp so is identically zero modulo p. | |
| Mar 6, 2017 at 10:29 | history | asked | Zakariae.B | CC BY-SA 3.0 |