Algorithms for Modular Elliptic Curves
by J. E. Cremona
Publisher: Cambridge University Press 1992
Number of pages: 351
Elliptic curves are of central importance in computational number theory with numerous applications in such areas as cryptography primality testing and factorization. This book presents a thorough treatment of many algorithms concerning the arithmetic of elliptic curves complete with computer implementation. In the first part the author describes in detail the construction of modular elliptic curves giving an explicit algorithm for their computation. Then a collection of algorithms for the arithmetic of elliptic curves is presented, some of these have not appeared in book form before. Finally an extensive set of tables is provided giving the results of the author's implementations of the algorithms.
Home page url
Download or read it online for free here:
(multiple PDF files)
by Kenneth A. Ribet, William A. Stein - University of Washington
Contents: The Main objects; Modular representations and algebraic curves; Modular Forms of Level 1; Analytic theory of modular curves; Modular Symbols; Modular Forms of Higher Level; Newforms and Euler Products; Hecke operators as correspondences...
by Richard Dedekind - The Open Court Publishing
This is a book combining two essays: 'Continuity and irrational numbers' - Dedekind's way of defining the real numbers from rational numbers; and 'The nature and meaning of numbers' where Dedekind offers a precise explication of the natural numbers.
by J.S. Milne
This is an introduction to the theory of Shimura varieties, or, in other words, to the arithmetic theory of automorphic functions and holomorphic automorphic forms. Because of their brevity, many proofs have been omitted or only sketched.
by Pete L. Clark - University of Georgia
The goal is to find and explore open questions in both geometry of numbers -- e.g. Lattice Point Enumerators, the Ehrhart-Polynomial, Minkowski's Convex Body Theorems, Minkowski-Hlawka Theorem, ... -- and its applications to number theory.