Elliptic Curve Rank Leaderboard

curve #6584

y2 + xy + y = x3 − x2 − 1414843368736738261887x + 17175804281120629430859442828455
a-invariants
[1, -1, 1, -1414843368736738261887, 17175804281120629430859442828455]
c-invariants
[67912481699363436570561, -14839894898582617660615423139217825]
rank (lower bound)
≥ 19
torsion subgroup
trivial
conductor (N)
1982914490711650239645046455966333480243518698640213506
discriminant (Δ)
53817724184403896970135567828149176413317332631684087821143703552
Faltings height
11.1411
naive height
157.7175
primes of bad reduction
2, 13, 29, 2629860067256830556558417050353227427378672014111689
regulator
32641249210207168.16936407719201812880480188584459116919146950636592624665019
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,5,6,38,39,45,60,107,156,200: 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.