Elliptic Curve Rank Leaderboard

curve #6444

y2 + xy = x3 − x2 − 10232832567931879x + 401526276856958881572289
a-invariants
[1, -1, 0, -10232832567931879, 401526276856958881572289]
c-invariants
[491175963260730201, -346918700994120639005171805]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
616078358480899884602577360817997503648061974
discriminant (Δ)
-1073208500473727598977689762544951651354923958708
Faltings height
8.0392
naive height
122.2223
primes of bad reduction
2, 13, 67, 353661514627382252929148886807116821841597
regulator
87551858558439.2824958595419158866684275177416925933519397641455068370509
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,7,55,60,64,110,130,149,152,165: 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 17, proved: the 17 listed points come from the point search and are independent, and the 2-descent upper bound (ellrank) is 17. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.