First description of the algorithms
Keyword(s):
This chapter provides the first, informal description of the algorithms. It explains how the computation of the Galois representations V attached to modular forms over finite fields should proceed. The essential step is to approximate the minimal polynomial P of (3.1) with sufficient precision so that P itself can be obtained.
2018 ◽
Vol 371
(8)
◽
pp. 5341-5377
2018 ◽
Vol 19
(2)
◽
pp. 281-306
◽
Keyword(s):
2006 ◽
Vol 142
(05)
◽
pp. 1122-1156
◽