Elliptic Curve Rank Leaderboard

curve #6516

y2 + xy = x3 − x2 − 11932544235121449x + 499159103693367217887089
a-invariants
[1, -1, 0, -11932544235121449, 499159103693367217887089]
c-invariants
[572762123285829561, -431273463013639721468211885]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
6792655770912057655076591471745629739000288246
discriminant (Δ)
1100410234887753340122407818422792017718046695852
Faltings height
8.0588
naive height
122.6677
primes of bad reduction
2, 3, 164877103000059467, 2288794248468410813834493641
regulator
175770043061114.791572134034710919373187492370738094298254425579762473616
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,32,50,61,82,110,117,127,143,178: 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: the 17 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.