Elliptic Curve Rank Leaderboard

curve #6496

y2 + y = x3 + x2 − 314114521949847734522930x + 193984355833118123854488928171215506
a-invariants
[0, 1, 1, -314114521949847734522930, 193984355833118123854488928171215506]
c-invariants
[15077497053592691257100656, -167602483439904523992599990087472801304]
rank (lower bound)
≥ 19
torsion subgroup
trivial
conductor (N)
2201233101115632161881877774585510484195773539979034855
discriminant (Δ)
-14272575936295091134683531097482395186459943673377980502198243939029296875
Faltings height
12.7222
naive height
176.0293
primes of bad reduction
3, 5, 7, 47, 53, 242403607, 6898139839909, 5033058012181595839842686447
regulator
14687330929661136.70455527840581323969178186767021282923860342995440916169851
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,20,22,99,116,144,145,161,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 >= 19: the 19 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.