Elliptic Curve Rank Leaderboard

curve #6510

y2 = x3 − 840750115979527767x + 308129759389150392179800890
a-invariants
[0, 0, 0, -840750115979527767, 308129759389150392179800890]
c-invariants
[40356005567017332816, -266224112112225938843347968960]
rank (lower bound)
≥ 18
torsion subgroup
trivial
conductor (N)
164297669584601186159725572720336551472620693277672
discriminant (Δ)
-2981016916943003921682060791437786389919229858830080768
Faltings height
9.2168
naive height
135.5083
primes of bad reduction
2, 3, 7, 325987439651986480475645977619715379905993439043
regulator
2584668277061101.9918829568474191511945768389806982861730441324810772830084
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,4,14,21,37,65,113,141,178,197: 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 >= 18: the 18 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.