Elliptic Curve Rank Leaderboard

curve #6484

y2 + xy + y = x3 − x2 − 76094048236367904720506597x + 257166908565948460850249142173326259485
a-invariants
[1, -1, 1, -76094048236367904720506597, 257166908565948460850249142173326259485]
c-invariants
[3652514315345659426584316641, -222192209000963033860196203370334258770385]
rank (lower bound)
≥ 21
torsion subgroup
trivial
conductor (N)
80043266134234367016571902619913942762718535666698465277063660482
discriminant (Δ)
-371349885848318138853423248205817314992901319998717759199621733582683667693568
Faltings height
13.7142
naive height
190.4087
primes of bad reduction
2, 3, 7, 13, 739, 23669, 9148957, 94320931, 447911121627965663, 7227948420235368763549
regulator
24318006525217584197.443925281143923916306997604557935069655517884153158194673449
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,27,35,58,72,80,102,109,152,193: 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.