Table of Contents
Fetching ...

An algorithm for determining torsion growth of elliptic curves

Enrique González-Jiménez, Filip Najman

Abstract

We present a fast algorithm that takes as input an elliptic curve defined over $\mathbb Q$ 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 $F \varsubsetneq K$. We ran this algorithm on all elliptic curves of conductor less than 400.000 (a total of 2.483.649 curves) and all $d \leq 23$ and collected various interesting data. In particular, we find a degree 6 sporadic point on $X_1(4,12)$, which is so far the lowest known degree a sporadic point on $X_1(m,n)$, for $m\geq 2$.

An algorithm for determining torsion growth of elliptic curves

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 .

Paper Structure

This paper contains 15 sections, 11 theorems, 10 equations, 4 tables.

Key Result

Proposition 2.2

Let $E$ be an elliptic curve defined over a number field $K$ such that its $\ell$-adic representation is defined modulo $\ell^n$. Then for any point $P\in E({\overline{K}})$ of order $\ell^{n+1}$, we have $[K(P):K(\ell P)]=\ell^2$.

Theorems & Definitions (36)

  • Conjecture 2.1
  • Proposition 2.2
  • proof
  • Lemma 2.3
  • proof
  • Lemma 2.4
  • proof
  • Lemma 2.5
  • proof
  • Proposition 2.6
  • ...and 26 more