Elliptic Curve Rank Leaderboard

curve #6506

y2 = x3 + x2 − 32762600338616857900x + 71813786852678063732257290000
a-invariants
[0, 1, 0, -32762600338616857900, 71813786852678063732257290000]
c-invariants
[1572604816253609179216, -62047111850149475962191953635264]
rank (lower bound)
≥ 18
torsion subgroup
trivial
conductor (N)
17215711487606289426109405825824671706004755363080
discriminant (Δ)
22767778442359317766029689204653128331191288967673300000000
Faltings height
10.0382
naive height
146.4211
primes of bad reduction
2, 5, 23, 1838988631, 4957400537, 2052598913453611940344986917
regulator
1243401247499361.3360965767192010687755046253199341981745981184543632551513
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,5,34,43,81,92,99,125,150,169: 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.