Open Access
2007 Finding All Elliptic Curves with Good Reduction Outside a Given Set of Primes
J. E. Cremona, M. P. Lingham
Experiment. Math. 16(3): 303-312 (2007).

Abstract

We describe an algorithm for determining elliptic curves defined over a given number field with a given set of primes of bad reduction. Examples are given over $\Q$ and over various quadratic fields.

Citation

Download Citation

J. E. Cremona. M. P. Lingham. "Finding All Elliptic Curves with Good Reduction Outside a Given Set of Primes." Experiment. Math. 16 (3) 303 - 312, 2007.

Information

Published: 2007
First available in Project Euclid: 7 March 2008

zbMATH: 1149.11028
MathSciNet: MR2367320

Subjects:
Primary: 11G05 , 11Y50

Keywords: Diophantine equations , Elliptic curves

Rights: Copyright © 2007 A K Peters, Ltd.

Vol.16 • No. 3 • 2007
Back to Top