Computing the Rank of Elliptic Curves over Number Fields-Reference-Cited by-同舟云学术

Computing the Rank of Elliptic Curves over Number Fields

Published:2002 Issue: Volume:5 Page:7-17
ISSN:1461-1570
Container-title:LMS Journal of Computation and Mathematics
language:en
Short-container-title:LMS J. Comput. Math.

Author:

Simon Denis

Abstract

AbstractThis paper describes an algorithm of 2-descent for computing the rank of an elliptic curve without 2-torsion, defined over a general number field. This allows one, in practice, to deal with fields of degree from 1 to 5.

Publisher

Wiley

Subject

Computational Theory and Mathematics,General Mathematics

Reference25 articles.

1. Periods of cusp forms and elliptic curves over imaginary quadratic fields

2. 21 Simon D. , ‘Equations dans les corps de nombres et discriminants minimaux’, Doctoral Thesis, Université Bordeaux I, France (1998).

3. 23 Simon D. , ‘The gp-program’, http://www.math.unicaen.fr/~simon/ell.gp.

4. Solving norm equations in relative number fields using $S$-units

5. 20 Schaefer E. F. , and Stoll M. , ‘HOW to do a p-descent on an elliptic curve’, preprint, 2001.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Elliptic Curves with Good Reduction Outside of the First Six Primes;Arithmetic Geometry, Number Theory, and Computation;2021

2. On elliptic curves of prime power conductor over imaginary quadratic fields with class number 1;Proceedings of the London Mathematical Society;2018-11-22

3. On the equivalence of binary quartics;Journal of Symbolic Computation;2009-06

4. Explicit n-descent on elliptic curves, I. Algebra;Journal für die reine und angewandte Mathematik (Crelles Journal);2008-01-01

5. Some Improvements to 4-Descent on an Elliptic Curve;Lecture Notes in Computer Science;2008