Elliptic Curve Rank Leaderboard

curve #6525

y2 + y = x3 − 219240483913717x + 1268418926456876148186
a-invariants
[0, 0, 1, -219240483913717, 1268418926456876148186]
c-invariants
[10523543227858416, -1095913952458740992032920]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
502455899915836093929682048280723478616723
discriminant (Δ)
-20600691896549279851116963979509662623285643
Faltings height
7.1083
naive height
110.7073
primes of bad reduction
41, 305023, 5570536413582967, 7212477772603119683
regulator
40698693770320.54372681211187605240635100373919784395474972654588612469
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,7,49,55,92,100,111,123,128,153: 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 >= 16: the 16 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.