A computational study of the asymptotic behaviour of coefficient fields of modular forms
From MaRDI portal
Publication:3171748
Abstract: The article motivates, presents and describes large computer calculations concerning the asymptotic behaviour of arithmetic properties of coefficient fields of modular forms. The observations suggest certain patterns, which deserve further study.
Recommendations
- On the computation of the coefficients of modular forms
- Algorithmic Number Theory
- Asymptotics of number fields and the Cohen-Lenstra heuristics
- Computations with classical and p-adic modular forms
- On the computation of coefficients of modular forms: the reduction modulo \(p\) approach
- Computing coefficients of modular forms
- scientific article; zbMATH DE number 1210371
- On the computation of general vector-valued modular forms
- Modular forms with large coefficient fields via congruences
Cited in
(3)
This page was built for publication: A computational study of the asymptotic behaviour of coefficient fields of modular forms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3171748)