Elliptic Curve Rank Leaderboard

curve #7845

y2 + xy = x3 − x2 − 912567183879954438755764x + 333580575824174762586056018768208724
a-invariants
[1, -1, 0, -912567183879954438755764, 333580575824174762586056018768208724]
c-invariants
[43803224826237813060276681, -288213617511889880362634330056961092485]
rank (lower bound)
≥ 21
torsion subgroup
trivial
conductor (N)
239490377322018048249476279131989865123938774815679392176595569570442
discriminant (Δ)
566634232743894702158260876426288020883239141213897441889825117603665772
Faltings height
12.6027
naive height
177.1252
primes of bad reduction
2, 7, 13, 22151167, 38270473855805939117, 1552230559560745222993543902662922508229
regulator
282714744343630082035.61951467516445978155893161884233636381218735028319841615808
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,8,17,20,52,74,100,102,107,158: 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 >= 21: the 21 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.