Elliptic Curve Rank Leaderboard

curve #6505

y2 = x3 + x2 − 118921934227546178500x + 702902268232433253444380573984
a-invariants
[0, 1, 0, -118921934227546178500, 702902268232433253444380573984]
c-invariants
[5708252842922216568016, -607307559787071848033478115330240]
rank (lower bound)
≥ 18
torsion subgroup
trivial
conductor (N)
13319113901119342563617347346081167126281944996568
discriminant (Δ)
-105800869410754846603700885459678760198441160026722098539341568
Faltings height
10.6044
naive height
150.9732
primes of bad reduction
2, 3, 17, 151, 302322149, 396160157749, 1805084182240184448733271
regulator
909304895537398.58356067193965252913294086622144373323688229819218279604345
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,3,16,37,52,60,113,135,170,174: 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.