Elliptic Curve Rank Leaderboard

curve #6504

y2 + xy + y = x3 − x2 − 3706264993154900095730x + 87185257370033873299694608141297
a-invariants
[1, -1, 1, -3706264993154900095730, 87185257370033873299694608141297]
c-invariants
[177900719671435204595025, -75328062366908713292414683013403225]
rank (lower bound)
≥ 18
torsion subgroup
trivial
conductor (N)
8228449224205764207124047078328908263712751841550
discriminant (Δ)
-25460944043131256715924181305813687745322277173224203249745920000
Faltings height
11.2100
naive height
160.6143
primes of bad reduction
2, 3, 5, 7, 53, 67, 744843943, 356371063635541, 395905015583754707
regulator
1299989947977981.1644119293745432993604783712476006343664866194920276216312
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,15,39,67,68,92,108,170,174,195: 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.