Elliptic Curve Rank Leaderboard

curve #6445

y2 = x3 − 2315798183384130627x + 1415442519060208520102098146
a-invariants
[0, 0, 0, -2315798183384130627, 1415442519060208520102098146]
c-invariants
[111158312802438270096, -1222942336468020161368212798144]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
636729961016074618212602433984860064248378160
discriminant (Δ)
-70657923773953800383052492099299921329642524415200000000
Faltings height
9.4765
naive height
138.5576
primes of bad reduction
2, 3, 5, 137, 269032733, 23993693057739281305146401684243
regulator
44808456261264.1459138801005183335127817129610410063331179348932280130778
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,3,29,34,45,74,107,124,172,176: 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, proved: the 17 listed points come from the point search and are independent, and the 2-descent upper bound (ellrank) is 17. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.