Timeline for How do you compute modular symbols?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 15, 2021 at 8:15 | comment | added | Chris Wuthrich | Glenn Stevens did not invent overconvergent modular symbols for computations. They are crucial for theoretical advances on (critical) $p$-adic $L$-functions (in families). Depending on what you want to prove you will encounter them. But that is an entire new questions to be asked here and I won't be the best person to answer. | |
| Oct 14, 2021 at 23:40 | comment | added | Adithya Chakravarthy | A follow-up question about overconvergent modular symbols. From what I've read, the main benefit of using them is computational speed-up. Is that true, or are they also useful for proofs? (i.e: is it worth learning about overconvergent modular symbols if I just want to able to prove things about the coefficients of p-adic L functions, and not that interested in computing them on a computer?) | |
| Oct 12, 2021 at 21:25 | comment | added | Adithya Chakravarthy | Ah, this is wonderful! The second paragraph ("The second method is to determine ...") was exactly what I needed. Much appreciated :) | |
| Oct 12, 2021 at 21:23 | vote | accept | Adithya Chakravarthy | ||
| Oct 12, 2021 at 18:24 | history | answered | Chris Wuthrich | CC BY-SA 4.0 |