Elliptic Curve Rank Leaderboard

curve #6547

y2 + xy + y = x3 + x2 − 110532126703288550x + 14252089027099905774388451
a-invariants
[1, 1, 1, -110532126703288550, 14252089027099905774388451]
c-invariants
[5305542081757850401, -12313804959205884202255499825]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
29049175344659582824795499727922854712734
discriminant (Δ)
-1322495839207066340199292625313483013001887361630208
Faltings height
8.6331
naive height
129.3610
primes of bad reduction
2, 3, 19, 29, 41, 214312302426184342029978750593325179
regulator
1133502709557.467196938435667517265019317351868465790940730502675196617
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,2,41,50,61,68,79,86,144,149: 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.