Skip to main content

A Database of Elliptic Curves — First Report

  • Conference paper
  • First Online:
Algorithmic Number Theory (ANTS 2002)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2369))

Included in the following conference series:

Abstract

In the late 1980s, Brumer and McGuinness [2] undertook the construction of a database of elliptic curves whose absolute discriminant |Δ| was both prime and satisfied |Δ| ≤ 108. While the restriction to primality was nice for many reasons, there are still many curves of interest lacking this property. As ten years have passed since the original experiment, we decided to undertake an extension of it, simultaneously extending the range for the type of curves they considered, and also including curves with composite discriminant. Our database can be crudely described as being the curves with |Δ| ≤ 1012 which either have conductor smaller than 108 or have prime conductor less than 1010—but there are a few caveats concerning issues like quadratic twists and isogenous curves. For each curve in our database, we have undertaken to compute various invariants (as did Brumer and McGuinness), such as the Birch—Swinnerton-Dyer L-ratio, generators, and the modular degree. We did not compute the latter two of these for every curve. The database currently contains about 44 million curves; the end goal is find as many curves with conductor less than 108 as possible, and we comment below on this direction of growth of the database. Of these 44 million curves, we have started a first stage of processing (computation of analytic rank data), with point searching to be carried out in a later second stage of computation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Breuil, B. Conrad, F. Diamond, and R. Taylor, On the modularity of elliptic curves over Q: Wild 3-adic exercises. J. Amer. Math. Soc. 14 (2001), 843–939.

    Article  MATH  MathSciNet  Google Scholar 

  2. A. Brumer, O. McGuinness, The behavior of the Mordell-Weil group of elliptic curves. Bull. Amer. Math. Soc. (N.S.) 23 (1990), no. 2, 375–382.

    Article  MATH  MathSciNet  Google Scholar 

  3. I. Connell, Lecture Notes from class at McGill University, 1991.

    Google Scholar 

  4. J. Cremona, Algorithms for modular elliptic curves. Cambridge University Press, Cambridge, 1992. Second edition 1997.

    MATH  Google Scholar 

  5. N. Elkies, Rational points near curves and small nonzero |x 3-y 2| via lattice reduction. In Algorithmic number theory (Leiden 2000), 33–63, Lecture Notes in Comput. Sci., 1838, Springer, Berlin, 2000.

    Chapter  Google Scholar 

  6. G. Jaeschke, On strong pseudoprimes to several bases. Math. Comp. 61 (1993), no. 204, 915–926.

    Article  MATH  MathSciNet  Google Scholar 

  7. J.-F. Mestre, J. Oesterlé, Courbes de Weil semi-stables de discriminant une puissance m-ième. (French) J. Reine Angew. Math. 400 (1989), 173–184.

    MATH  Google Scholar 

  8. O. Neumann, Elliptische Kurven mit vorgeschriebenem Reduktionsverhalten. I (German) Math. Nachr. 49 (1971), 107–123.

    Article  Google Scholar 

  9. O. Neumann, Elliptische Kurven mit vorgeschriebenem Reduktionsverhalten. II (German) Math. Nachr. 56 (1973), 269–280.

    Article  MATH  Google Scholar 

  10. B. Setzer, Elliptic curves of prime conductor. J. London Math. Soc. (2) 10 (1975), 367–378.

    Article  MATH  MathSciNet  Google Scholar 

  11. G. Stevens, Stickelberger elements and modular parametrizations of elliptic curves. Invent. Math. 98 (1989), no. 1, 75–106.

    Article  MATH  MathSciNet  Google Scholar 

  12. J. Tate, Algorithm for determining the type of a singular fiber in an elliptic pencil. In Modular functions of one variable IV, edited by B. Birch and W. Kuyk, 33–52, Lecture Notes in Math., Vol. 476, Springer, Berlin, 1975.

    Chapter  Google Scholar 

  13. M. Watkins, Computing the modular degree of an elliptic curve, preprint, 2001.

    Google Scholar 

  14. A. Wiles, Modular elliptic curves and Fermat’ s last theorem. Ann. of Math. (2) 141 (1995), no. 3, 443–551.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stein, W.A., Watkins, M. (2002). A Database of Elliptic Curves — First Report. In: Fieker, C., Kohel, D.R. (eds) Algorithmic Number Theory. ANTS 2002. Lecture Notes in Computer Science, vol 2369. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45455-1_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-45455-1_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43863-2

  • Online ISBN: 978-3-540-45455-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics