Elliptic Curve Rank Leaderboard

curve #6501

y2 = x3 − 519763339618191410497x + 4558082975086992435076548407545
a-invariants
[0, 0, 0, -519763339618191410497, 4558082975086992435076548407545]
c-invariants
[24948640301673187703856, -3938183690475161463906137824118880]
rank (lower bound)
≥ 19
torsion subgroup
trivial
conductor (N)
128819367123292381683043218556548306026945730239879506708
discriminant (Δ)
11346925133688086148169178863335000988077487702449546468867472
Faltings height
10.6497
naive height
154.7133
primes of bad reduction
2, 19, 61, 218111, 333226853, 4089136407467, 93495040721692249378889723
regulator
447892444475954009.6314067006165744903217618699997598753936319241052744540196
submitted by
Michael Rubinstein
submitted at
last updated

Witness: 19 independent points log in to add more points →

Commentary

Mestre ten-root construction, roots 0,3,12,27,31,79,122,126,191,195: with p(x) = prod (x - a_i), write p = q^2 - r with q a monic quintic and deg r <= 4; the genus-one curve y^2 = r(x) carries the ten points (a_i, q(a_i)), and the curve submitted is the minimal Weierstrass model of its Jacobian. Found by enumerating integer ten-root sets 0 = a_1 < ... < a_10 and scoring each by S = sum of -a_p log(p)/p over the good primes 5 <= p <= 199 (with early abort on low partial sums); for the sets with S >= 31, or S >= 30 and one bad prime in that range, or S >= 29 and two or more bad primes, rational points were found by a point search on the quartic y^2 = r(x), and the curves were screened by conductor and by a GRH explicit-formula upper bound on the rank. Rank >= 19: the 19 listed points come from the point search and are independent (height matrix nonsingular at 57 and 115 digits). Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.