Elliptic Curve Rank Leaderboard

curve #6541

y2 + xy + y = x3 − x2 − 77835662641954975853198x + 8203125688734930886438608314019997
a-invariants
[1, -1, 1, -77835662641954975853198, 8203125688734930886438608314019997]
c-invariants
[3736111806813838840953489, -7087500595050167782752295308528986937]
rank (lower bound)
≥ 19
torsion subgroup
trivial
conductor (N)
3308681347373330192964339968859809616051317055344809770
discriminant (Δ)
1109935999900663965421919937170916269443104727352628159086920885862400
Faltings height
12.0377
naive height
169.7403
primes of bad reduction
2, 3, 5, 7, 47, 3659, 178571, 171018540415717554590649265260417761501513
regulator
21000416350009067.46899357168647942339086155773504414904893609361624968463027
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,15,49,76,101,107,109,147,159,185: 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.