An Algorithm for Determining Torsion Growth of Elliptic Curves

From MaRDI portal



Abstract: We present a fast algorithm that takes as input an elliptic curve defined over mathbbQ and an integer d and returns all the number fields K of degree d′ dividing d such that E(K)tors contains E(F)tors as a proper subgroup, for all FvarsubsetneqK. We ran this algorithm on all elliptic curves of conductor less than 400.000 (a total of 2.483.649 curves) and all dleq23 and collected various interesting data. In particular, we find a degree 6 sporadic point on X1(4,12), which is so far the lowest known degree a sporadic point on X1(m,n), for mgeq2.




Cites work









This page was built for publication: An Algorithm for Determining Torsion Growth of Elliptic Curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6042963)