Elliptic Curve Rank Leaderboard

curve #7145

y2 + y = x3 − 41567894205327519897x + 103355713188949953449147832886
a-invariants
[0, 0, 1, -41567894205327519897, 103355713188949953449147832886]
c-invariants
[1995258921855720955056, -89299336195252759780063727613720]
rank (lower bound)
≥ 18
torsion subgroup
trivial
conductor (N)
1346785049168040614196778899750602538972303940677 ★ record for rank ≥ 18
discriminant (Δ)
-18014827709153755575210971844641853904842216383310837724203
Faltings height
10.0601
naive height
147.1391
primes of bad reduction
3, 29, 37, 61, 809, 1061, 4359592345553, 610965142773717232201733
regulator
577236068744645.00376770280600964021911093531605592765620882273659666716332
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,1,16,18,33,42,49,52,168,177: 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.