Elliptic Curve Rank Leaderboard

curve #6545

y2 = x3 − 151475457296078812x + 22814445402554507174632384
a-invariants
[0, 0, 0, -151475457296078812, 22814445402554507174632384]
c-invariants
[7270821950211782976, -19711680827807094198882379776]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
737394839101760115901764738744503140274585120
discriminant (Δ)
-2418655072253773180157788343081970300100639193600000
Faltings height
8.6974
naive height
130.3020
primes of bad reduction
2, 5, 41, 2488355017, 45173517884354677835610166455181
regulator
65394788216652.6585623264746874270603073923220368011717756533882574582837
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,4,50,56,57,60,93,127,131,154: 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.