150
Views
9
CrossRef citations to date
0
Altmetric
Original Articles

Computing All Elliptic Curves Over an Arbitrary Number Field with Prescribed Primes of Bad Reduction

References

  • [Bennett and Rechnitzer 16] M. A. Bennett and A. Rechnitzer. Computing elliptic curves over Q: Bad reduction at one prime. Personal communication. 2016.
  • [Cremona and Lingham 07] J. E. Cremona and M. P. Lingham. “Finding All Elliptic Curves with Good Reduction Outside a Given Set of Primes.” Exp. Math. 16:3 (2007), 303–312.
  • [Cohen 96] H. Cohen. A Course in Computational Algebraic Number Theory. Number 138 in Graduate Texts in Mathematics. New York: Springer-Verlag, 1996.
  • [Cohen 99] H. Cohen. Advanced Topics in Computational Number Theory. Number 193 in Graduate Texts in Mathematics. New York: Springer-Verlag, 1999.
  • [Cremona et al. 16] J. Cremona, A. Pacetti, and N. Vescovo. “Computing Rational Elliptic Curves.” Preprint, 2016.
  • [Cremona 97] J. E. Cremona. Algorithms for Modular Elliptic Curves. Second edition. Cambridge: Cambridge University Press, 1997.
  • [The Sage Developers 15] The Sage Developers. Sage Mathematics Software (Version 6.8). Available at (http://www.sagemath.org), 2015.
  • [Evertse and Győry 16] Jan-Hendrink Evertse and Kálmán Győry. Unit Equations in Diophantine Number Theory. Cambridge Studies in Advanced Mathematics. Cambridge, UK: Cambridge University Press, 2016.
  • [Fincke and Pohst 85] U. Fincke and M. Pohst. “Improved Methods for Calculating Vectors of Short Lenght in a Lattice, Including a Complexity Analysis.” Math. Comput. 44:170 (1985), 463–471.
  • [Känel and Matschke 16] Rafael von Känel and Benjamin Matschke. “Solving S–unit, Mordell, Thue, Thue–Mahler and Generalized Ramanujan–Nagell Equations via Shimura–Taniyama Conjecture.” Available online (arXiv:1605.06079), 2016.
  • [Laska 83] Michael Laska. Elliptic Curves Over Number Fields with Prescribed Reduction Type. Aspects of Mathematics, E4. Friedr. Vieweg & Sohn, Braunschweig; distributed by Philadelphia, PA: Heyden & Son, Inc., 1983.
  • [The LMFDB Collaboration 15] The LMFDB Collaboration. “The L-functions and Modular Forms Database.” Available online (http://www.lmfdb.org), 2015. [Online; accessed 12 November 2015].
  • [Ribet 76] Kenneth A. Ribet. “A Modular Construction of Unramified p-Extensions of Q(μp).” Invent. Math. 34:3 (1976), 151–162.
  • [Silverman 08] J. Silverman. The Arithmetic of Elliptic Curves, Volume 106 of Graduate Text in Mathematics. Second edition. New York: Springer-Verlag, 2008.
  • [Smart 95] N. P. Smart. “The Solution of Triangularly Connected Decomposable Form Equations.” Math. Comput. 64:210 (1995), 819–840.
  • [Smart 98] N. P. Smart. The Algorithmic Resolution of Diophantine Equations. Number 41 in Students Texts. London, UK: London Mathematical Society, 1998.
  • [Smart 99] N. P. Smart. “Determining the Small Solutions to S-unit Equations.” Math. Comput. 68:228 (1999), 1687–1699.
  • [Tzanakis and De Weger 89] N. Tzanakis and B. M. M. De Weger. “On the Practical Solution of the Thue Equation.” J. Number Theory 31 (1989), 99–132.
  • [Tzanakis and De Weger 91] N. Tzanakis and B. M. M. De Weger. “Solving a Specific Thue-Mahler Equation.” Math. Comput. 57:196 (1991), 799–815.
  • [Tzanakis and De Weger 92] N. Tzanakis and B. M. M. De Weger. “How to Explicitly Solve a Thue-Mahler Equation.” Compos. Math. 84:3 (1992), 223–288.
  • [De Weger 87] B. M. M. De Weger. “Solving Exponential Diophantine Equations Using Lattice Basis Reduction Algorithm.” J. Number Theory 26 (1987), 325–367.
  • [De Weger 88] B. M. M. De Weger “Algorithms For Diophantine Equations.” PhD thesis, University of Leiden, 1988.
  • [Wildanger 00] K. Wildanger. “Solving Unit and Index Form Equations in Algebraic Number Fields.” J. Number Theory 82 (2000), 188–224.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.