Elliptic Curve Rank Leaderboard

curve #6489

y2 + xy = x3 − x2 − 5146779502813002917578x + 147174015514176512090179370677000
a-invariants
[1, -1, 0, -5146779502813002917578, 147174015514176512090179370677000]
c-invariants
[247045416135024140043753, -127158349403136802073307367634731125]
rank (lower bound)
≥ 20
torsion subgroup
trivial
conductor (N)
31737968087921775307522975461902370443739390331195531141429586
discriminant (Δ)
-631775992758170859271552349544628586053076303932778242901297338916
Faltings height
11.3927
naive height
161.6615
primes of bad reduction
2, 37, 269, 2081, 417581948294786754772603031, 1834768700946805932206043071
regulator
20254320983398498603.7064329186707485602436402149914632427818981608835839898442
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,25,26,48,49,80,135,140,150,175: 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 >= 20: the 20 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.