Elliptic Curve Rank Leaderboard

curve #6546

y2 + xy + y = x3 − x2 − 10537883665333060412x + 13199348594383675228960518655
a-invariants
[1, -1, 1, -10537883665333060412, 13199348594383675228960518655]
c-invariants
[505818415935986899761, -11404237183271312526109947069225]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
792310786558823210949081288451917808740707994
discriminant (Δ)
-371432788118025432454408215357490921967862530287623733248
Faltings height
9.7261
naive height
143.0231
primes of bad reduction
2, 3, 7, 19, 83, 5167762141, 771597503923907829860906802167
regulator
29637232399205.2714794832654948933407770375897142586541763990433348978224
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,16,81,86,89,97,106,107,148,170: 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 >= 17: the 17 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.