Elliptic Curve Rank Leaderboard

curve #6131

y2 + xy + y = x3 − x2 − 84901834894153305402x + 303937731692821368239156545401
a-invariants
[1, -1, 1, -84901834894153305402, 303937731692821368239156545401]
c-invariants
[4075288074919358659281, -262602200164258865821494141259929]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
6997011738463637227893675954536446387040433730
discriminant (Δ)
-739375954467144903311737691117621487498952399011971072000000
Faltings height
10.3033
naive height
149.2964
primes of bad reduction
2, 5, 29, 139, 6028103, 381358487, 75506740709120741075620403
regulator
2604765951321901288.39070935738683406457185636274905302699058097415951314
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,1,9,15,16,28,32,67,102,114: 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); the sets with S >= 31, or S >= 30 and one bad prime in that range, or S >= 29 and two or more bad primes, were screened by exact conductor and by a GRH explicit-formula upper bound on the rank, and the survivors were certified with ellrank. Rank 17, proved: 17 independent points listed, matching the 2-descent upper bound. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.