Elliptic Curve Rank Leaderboard

curve #6550

y2 + xy + y = x3 − x2 − 2686350221523987x + 53700032882646999819315
a-invariants
[1, -1, 1, -2686350221523987, 53700032882646999819315]
c-invariants
[128944810633151361, -46396827830355359994707265]
rank (lower bound)
≥ 15
torsion subgroup
trivial
conductor (N)
901860182242424097416884928108493502
discriminant (Δ)
-5052472742301622700840385982917932385892302848
Faltings height
7.6498
naive height
118.1985
primes of bad reduction
2, 7, 43, 71, 1030647031680323, 20472666704239247
regulator
64664944128.099907333151606368258097669897080686299280895298557470355
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,13,20,38,80,135,140,143,185,198: 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 >= 15: the 15 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.