Elliptic Curve Rank Leaderboard

curve #6540

y2 + xy = x3 − x2 − 22206879170534811129792x + 929370926131404963735727057031216
a-invariants
[1, -1, 0, -22206879170534811129792, 929370926131404963735727057031216]
c-invariants
[1065930200185670934230025, -802976480172737202766832658070935525]
rank (lower bound)
≥ 20
torsion subgroup
trivial
conductor (N)
4921121916676464499655415348853349991006911459088879260599525050
discriminant (Δ)
327746719650652535677050662233633109401060303175319358755928368330000
Faltings height
11.8549
naive height
165.9777
primes of bad reduction
2, 3, 5, 37, 241489, 135990955133666698559373333081513118450561242863665697
regulator
38620956645577976866.7279233448335617797446021621616520258532602829169773597620
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,5,8,20,23,25,80,81,145,191: 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.