Abstract
We discuss the computational application of Heegner points to the study of elliptic curves over Q, concentrating on the curves E d : Dy 2 = x 3 − x arising in the “congruent number” problem. We begin by briefly reviewing the cyclotomic construction of units in real quadratic number fields, which is analogous in many ways to the Heegner-point approach to the arithmetic of elliptic curves, and allows us to introduce some of the key ideas in a more familiar setting. We then quote the key results and conjectures that we shall need concerning elliptic curves and Heegner points, and show how they yield practical algorithms for finding rational points on E d and other properties of such curves. We conclude with a report on more recent work along similar lines on the elliptic curves x 3 + y 3 = A.
Preview
Unable to display preview. Download preview PDF.
References
Birch, B.J.: Elliptic curves and modular functions. Symp. Math. 4 (1970), 27–37.
Birch, B.J.: Heegner points of elliptic curves. Symp. Math. 15 (1975), 441–445.
Birch, J., Stephens, N.M.: The parity of the rank of the Mordell-Weil group. Topology 5, 295–299 (1966).
Buhler, J.P., Gross, B.H., Zagier, D.: On the conjecture of Birch and Swinnerton-Dyer for an elliptic curve of rank 3. Math, of Computation 44 (1985) #175, 473–481.
Cohen, H.: A course in computational algebraic number theory. Berlin: Springer 1993.
Cohen, H., Lenstra, H.W.: Heuristics on class groups of number fields. Lect. Notes in Math. 1068 (1984: Proceedings of Journées Arithmétiques 1983 at Noord wijkerhout), 33–62.
Dickson, L.E.: History of the Theory of Numbers, Vol. II: Diophantine Analysis. New York: Stechert 1934.
Gebel, J., Zimmer, H.G.: Computing the Mordell-Weil Group of an Elliptic Curve over Q, CRM Proc. & Lect. Notes 4 (1994), 61–83.
Gross, B.H., Zagier, D.: Heegner points and derivatives of L-series. Invent. Math. 84 (1986), 225–320.
Hafner, J., McCurley, K.: A rigorous subexponential algorithm for computation of class groups. J. AMS 2 (1989), 837–850.
Heegner, K.: Diophantische Analysis und Modulfunktionen. Math. Z. 56 (1952), 227–253.
Koblitz, N.: Introduction to elliptic curves and modular forms. New York: Springer 1984.
Kolyvagm, V.A.: Euler systems. Pages 435–483 of The Grothendieck Festscrhift Vol. II, Birkhäuser: Boston 1990.
Monsky, P.: Mock Heegner points and congruent numbers. Math. Z. 204 (1990) #1, 45–67.
Rubin, K.: Tate-Shafarevich groups and L-functions of elliptic curves with complex multiplication. Invent. Math. 89 (1987), 527–560
Satgé, Ph.: Un analogue du calcul de Heegner. Invent. Math. 87, 425–439 (1987).
Selmer, E.S.: The Diophantine equation ax 3 + by 3 + cz 3 = 0. Acta Math. 85, 203–362 (1951).
Silverman, J.H.: The Arithmetic of Elliptic Curves. New York: Springer 1986.
Weil, A.: Number theory: An approach through history; From Hammurapi to Legendre. Boston: Birkhäuser, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Elkies, N.D. (1994). Heegner point computations. In: Adleman, L.M., Huang, MD. (eds) Algorithmic Number Theory. ANTS 1994. Lecture Notes in Computer Science, vol 877. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58691-1_49
Download citation
DOI: https://doi.org/10.1007/3-540-58691-1_49
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58691-3
Online ISBN: 978-3-540-49044-9
eBook Packages: Springer Book Archive