Elliptic Curve Rank Leaderboard

curve #6509

y2 + xy + y = x3 − x2 − 25443977028918972757097x + 1480011319201639338118091527889321
a-invariants
[1, -1, 1, -25443977028918972757097, 1480011319201639338118091527889321]
c-invariants
[1221310897388110692340641, -1278729779784720489095784581980840689]
rank (lower bound)
≥ 18
torsion subgroup
trivial
conductor (N)
62209683646987441959784598983560125347538651778630
discriminant (Δ)
107961725171300801101318183536361157187915956416016410364312640000000
Faltings height
11.8074
naive height
166.3859
primes of bad reduction
2, 3, 5, 7, 271, 10037, 288348405564539, 125900273648686732933892417
regulator
684494388065104.93579919480830319110777074028959403483343132598067696054248
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,18,70,86,102,109,149,157,166,195: 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.