An algorithm for determining torsion growth of elliptic curves
arXiv:1904.07071 · doi:10.1080/10586458.2020.1771638
Abstract
We present a fast algorithm that takes as input an elliptic curve defined over and an integer and returns all the number fields of degree dividing such that contains as a proper subgroup, for all . We ran this algorithm on all elliptic curves of conductor less than 400.000 (a total of 2.483.649 curves) and all and collected various interesting data. In particular, we find a degree 6 sporadic point on , which is so far the lowest known degree a sporadic point on , for .
arXiv comment15 pages, Added Supplementary material
References in corpus (15)
- Computing images of Galois representations attached to elliptic curves
- Growth of torsion groups of elliptic curves upon base change
- Torsion points and Galois representations on CM elliptic curves
- Gonality of the modular curve X1(N)
- Complete classification of the torsion structures of rational elliptic curves over quintic number fields
- Torsion subgroups of elliptic curves over quintic and sextic number fields
- Torsion of rational elliptic curves over quartic Galois number fields
- Computation on Elliptic Curves with Complex Multiplication
- Torsion of rational elliptic curves over quadratic fields
- Torsion subgroups of rational elliptic curves over the compositum of all cubic fields
- On the torsion of rational elliptic curves over quartic fields
- Torsion of rational elliptic curves over quadratic fields II
- Torsion of rational elliptic curves over cubic fields
- On the torsion of rational elliptic curves over sextic fields
- On the minimal degree of definition of p-primary torsion subgroups of elliptic curves