On the computation of coefficients of modular forms.
Notes prepared by John Voight of a talk given during the
Computational Arithmetic Geometry workshop at the MSRI, December
2000.
Summary/Résumé
The aim of this talk is to convince the
audience that, given a modular form f, it should be possible to
compute the coefficients ap(f) with p prime in time
polynomial in log(p). In the talk a method of computing is
proposed. What is still lacking is a proof that the time that is
needed is polynomial. These notes can also be found at the MSRI web
pages, together with a "streaming video" recording of the talk
itself: click
here.
The notes, in PostScript (95kB)
Back to Some talks.