Elliptic Curve Rank Leaderboard

curve #6513

y2 = x3 − 1668750035846556247x + 944476357300590618511075930
a-invariants
[0, 0, 0, -1668750035846556247, 944476357300590618511075930]
c-invariants
[80100001720634699856, -816027572707710294393569603520]
rank (lower bound)
≥ 18
torsion subgroup
trivial
conductor (N)
16457814113570642745548909115192863789336093133235112
discriminant (Δ)
-87950558622921514832213370311590664090212081704008438528
Faltings height
9.4611
naive height
137.7485
primes of bad reduction
2, 167, 1151, 10702626532493641786073103000250279494878245117
regulator
8326811878457588.6124603595615606019541663616734195792091092565318091516167
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,12,27,61,77,96,136,139,188,200: 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 >= 18: the 18 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.