Elliptic Curve Rank Leaderboard

curve #6503

y2 = x3 − 356484526991117814367x + 2586738858832553806989380365090
a-invariants
[0, 0, 0, -356484526991117814367, 2586738858832553806989380365090]
c-invariants
[17111257295573655089616, -2234942374031326489238824635437760]
rank (lower bound)
≥ 19
torsion subgroup
trivial
conductor (N)
273533793796876732889999722911159668751149628173587165378376
discriminant (Δ)
8753081401500055452479991133157109400036788101554789292108032
Faltings height
10.5872
naive height
153.5821
primes of bad reduction
2, 419, 1013, 134764445027, 594452802907, 381063290769779, 2638807524349021
regulator
856708172309491669.5088070501031045033668742197602488434983928708639439596085
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,4,21,26,35,73,84,96,151,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 >= 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.