Elliptic Curve Rank Leaderboard

curve #6514

y2 + xy = x3 + x2 − 2559387047119766477x + 1581453270579165442169778705
a-invariants
[1, 1, 0, -2559387047119766477, 1581453270579165442169778705]
c-invariants
[122850578261748790921, -1366375626701778278997804732965]
rank (lower bound)
≥ 18
torsion subgroup
trivial
conductor (N)
1243144522086178951340191789390745525222020024679758998
discriminant (Δ)
-7458867132517073708041150736344473151332120148078553988
Faltings height
9.3858
naive height
138.7794
primes of bad reduction
2, 3, 109717225376844435481919, 1888406792729165666167018365607
regulator
24010083143959589.294498412294610995943716928868549998921907291829728142552
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,4,21,60,83,85,104,109,147,173: 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.