Home » Computer » Algorithms for Modular Elliptic Curves

# Algorithms for Modular Elliptic Curves

• Category: Computer
• Author: J. E. Cremona
• Pages: 351 pages
• File type: PDF Files, DVI, PostScript, etc.

Read and download free eBook intituled Algorithms for Modular Elliptic Curves in format PDF Files, DVI, PostScript, etc. – 351 pages created by J. E. Cremona.

This book presents a thorough treatment of many algorithms concerning the arithmetic of elliptic curves, with remarks on computer implementation. An extensive set of tables is provided giving the results of the author’s implementation of the algorithms.

Although the idea of using modular symbols for computing the modular elliptic curves defined over Q with conductor N is not new, neither the complete description of the algorithm nor the description of its implementation had been available before the writing of this book; moreover, the complete list of all the modular curves defined over Q with conductor less than 999…will prove very useful for any mathematician interested in the arithmetic of elliptic curves.

It is in three parts. First, the author describes in detail the construction of modular elliptic curves, giving an explicit algorithm for their computation using modular symbols. Second, a collection of algorithms for the arithmetic of elliptic curves is presented; some of these have not appeared in book form before. They include: finding torsion and nontorsion points, computing heights, finding isogenies and periods, and computing the rank. Finally, an extensive set of tables is provided giving the results of the author’s implementations of the algorithms. These tables extend the widely used “Antwerp IV Tables” in two ways, the range of conductors (up to 1000) and the level of detail given for each curve. In particular the quantities relating to the Birch-Swinnerton-Dyer conjecture have been computed in each case and are included.