These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted student to implement it over any ring (such that a sufficient linear algebra theory is available in the chosen computer algebra system). The chosen approach is based on group cohomology and along the way the needed tools from homological algebra are provided.
CITATION STYLE
Wiese, G. (2019). Computational Arithmetic of Modular Forms. In Tutorials, Schools, and Workshops in the Mathematical Sciences (pp. 63–170). Birkhauser. https://doi.org/10.1007/978-3-030-12558-5_2
Mendeley helps you to discover research relevant for your work.