Elliptic Curve Rank Leaderboard

curve #6524

y2 + xy + y = x3 − x2 − 77702305945637847x + 8326704776766245869603695
a-invariants
[1, -1, 1, -77702305945637847, 8326704776766245869603695]
c-invariants
[3729710685390616641, -7194272910342338347079817825]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
30511387425960094231483481326456544379926
discriminant (Δ)
72615516458003271976753663823409002330525544005632
Faltings height
8.4712
naive height
128.2886
primes of bad reduction
2, 7, 11, 18011444761487658932398749307235268229
regulator
6139335829465.943556578719643844986571632300830319212714488896370664550
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,18,21,26,31,43,55,133,134,177: 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 >= 16: the 16 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.