Elliptic Curve Rank Leaderboard

curve #7719

y2 + xy + y = x3 − x2 − 85238000530292146907x + 299735776653307998493294680715
a-invariants
[1, -1, 1, -85238000530292146907, 299735776653307998493294680715]
c-invariants
[4091424025454023051521, -258971711010046702583663500406145]
rank (lower bound)
≥ 19
torsion subgroup
trivial
conductor (N)
1803928323704684368573870890952206652198895202432462 ★ record for rank ≥ 19
discriminant (Δ)
823536169971012816829519274073985616394158340842751937216512
Faltings height
10.3079
naive height
149.2895
primes of bad reduction
2, 3, 43, 228457, 153564811, 12271868461, 5413416548265738936896779
regulator
7460058593046874.657037080702539925724342995804864678982778724721679532984779
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,33,50,58,78,88,102,120,152,189: 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.