Elliptic Curve Rank Leaderboard

curve #6493

y2 + xy = x3 − x2 − 268236005824488436622434x + 53696023198846354788945604851827344
a-invariants
[1, -1, 0, -268236005824488436622434, 53696023198846354788945604851827344]
c-invariants
[12875328279575444957876841, -46393364043745311560390913089668379445]
rank (lower bound)
≥ 20
torsion subgroup
trivial
conductor (N)
15141241539563545332571561817468094769657291789078778794197996638938
discriminant (Δ)
-10386891696140592098144091406783113011984902167308042252819825694311468
Faltings height
12.2835
naive height
173.4604
primes of bad reduction
2, 7, 97829917669660331537, 11055076796424360976352235184081525568192325691
regulator
43160327638106075202.2980752951799132595670937171201881568299089958658725751524
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,1,39,64,65,114,124,150,151,168: 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.