This book presents a thorough treatment of many algorithms concerning the arithmetic of elliptic curves with remarks on computer implementation. 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 ...
Read More
This book presents a thorough treatment of many algorithms concerning the arithmetic of elliptic curves with remarks on computer implementation. 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.
Read Less
Add this copy of Algorithms for Modular Elliptic Curves to cart. $209.01, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 1992 by Cambridge University Press.
