Elliptic Curve Rank Leaderboard

curve #6498

y2 + xy = x3 − 48805101070706591709208900x + 132601598038184469079937867258404010000
a-invariants
[1, 0, 0, -48805101070706591709208900, 132601598038184469079937867258404010000]
c-invariants
[2342644851393916402042027201, -114567780704994895252343408185864127680801]
rank (lower bound)
≥ 19
torsion subgroup
trivial
conductor (N)
7225366625201708988410703605170496823734687573654248410
discriminant (Δ)
-155889355157290562131122737946303661724703221986701909423850322980649356800000
Faltings height
13.6234
naive height
189.0840
primes of bad reduction
2, 3, 5, 7, 11, 31, 67, 149, 449, 23189, 184411229, 1005439531, 5235443337652625965613
regulator
25682404972292939.33811618219981944748013213300988900516698180816468098125491
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,13,20,42,55,65,83,95,119,144: 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.