Elliptic Curve Rank Leaderboard

curve #6485

y2 + xy + y = x3 − x2 − 37094383587841840145515727x + 87430499935172500356082174687385737879
a-invariants
[1, -1, 1, -37094383587841840145515727, 87430499935172500356082174687385737879]
c-invariants
[1780530412216408326984754881, -75539951943981027920800025092429846130721]
rank (lower bound)
≥ 20
torsion subgroup
trivial
conductor (N)
150042411546129109678533765048810322892047214841958925629770
discriminant (Δ)
-35584006371595405919618132623445045676991719329491311922497843148435200000000
Faltings height
13.5265
naive height
188.2510
primes of bad reduction
2, 3, 5, 19, 47, 109, 510233, 33567965926342972952914286179074343117294405193
regulator
1231175078898561316.68919442333532976619392520030638069442882615653995497940727
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,36,40,62,93,109,117,143,163,199: 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 >= 20: the 20 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.