Elliptic Curve Rank Leaderboard

curve #7326

y2 = x3 + x2 − 93083888315040284860x + 358131875298018450766347205424
a-invariants
[0, 1, 0, -93083888315040284860, 358131875298018450766347205424]
c-invariants
[4468026639121933673296, -309425940284296101296855587526080]
rank (lower bound)
≥ 18
torsion subgroup
trivial
conductor (N)
1952591919848094503121988970845136201163756244296
discriminant (Δ)
-3789366832764585114093007233269057866096198146312685689017088
Faltings height
10.3902
naive height
149.6245
primes of bad reduction
2, 3, 11, 13, 17, 61, 548637453792457202145890223402278909139169
regulator
279341178652185.55358914405714707053783484682706092496481482363272260963736
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,9,45,63,79,80,119,158,167,190: 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.