Elliptic Curve Rank Leaderboard

curve #6068

y2 + xy + y = x3 − x2 − 90980855766592156488x + 334108410959987925402723235467
a-invariants
[1, -1, 1, -90980855766592156488, 334108410959987925402723235467]
c-invariants
[4367081076796423511409, -288669667049777702702368969642377]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
57135593756391946893120530343475250404125239830
discriminant (Δ)
-25369881019170372075833759456482477353310990825640948326400
Faltings height
10.1840
naive height
149.4857
primes of bad reduction
2, 5, 7, 11, 31, 293, 76862187676199, 106285486374011684312128487
regulator
167826353034492610530.277556700124212037412471497187048251433188681255359
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,20,21,26,35,60,75,90,106,131: 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.