Elliptic Curve Rank Leaderboard

curve #6519

y2 + y = x3 − x2 − 6674202848731630x + 162655156454237295317142
a-invariants
[0, -1, 1, -6674202848731630, 162655156454237295317142]
c-invariants
[320361736739118256, -140534053254290602719301400]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
133299129597562732119902707030702830923252701821
discriminant (Δ)
7598050387061075730834454300750061362625404003797
Faltings height
8.0915
naive height
120.9247
primes of bad reduction
3, 19, 20051, 50363, 16062394022628251, 144176524948432809631
regulator
289228768909796.132825990042882451536063144491613105588244656028195671145
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,13,60,75,149,152,155,156,175,191: 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 >= 17: the 17 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.