Elliptic Curve Rank Leaderboard

curve #6539

y2 + xy + y = x3 − x2 − 4285480072902795785630955x + 3427126744693057391780466331039871547
a-invariants
[1, -1, 1, -4285480072902795785630955, 3427126744693057391780466331039871547]
c-invariants
[205703043499334197710285825, -2961037507413875922802575906128752730625]
rank (lower bound)
≥ 20
torsion subgroup
trivial
conductor (N)
859421338760632239164478287624880625729536447400153078737350
discriminant (Δ)
-36850455723491360271274375272521122723978823005658044319507996939264000000
Faltings height
12.9706
naive height
181.7727
primes of bad reduction
2, 5, 11, 13, 16226773, 1937832332256277, 3822537304150634514527658702736349
regulator
962080350688402826.419266862892572201235626871245834638322184047351010990511551
submitted by
Michael Rubinstein
submitted at
last updated

Witness: 20 independent points log in to add more points →

Commentary

Mestre ten-root construction, roots 0,3,33,42,74,110,125,140,177,184: 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 >= 20: the 20 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.