Reference : Computational Arithmetic of Modular Forms
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Physical, chemical, mathematical & earth Sciences : Mathematics
Computational Arithmetic of Modular Forms
Wiese, Gabor mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit >]
In press
Notes from the International Autumn School on Computational Number Theory: Izmir Institute of Technology 2017
Buyukasik, Engin
Inam, Ilker
International Autumn School on Computational Number Theory
from 30-10-2017 to 03-11-2017
[en] 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.

File(s) associated to this reference

Fulltext file(s):

Open access
CAMF-arXiv-v1.pdfAuthor postprint905.79 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.