Elliptic Curve Rank Leaderboard

curve #6102

y2 + xy = x3 − x2 − 666435151399264x + 5847131931123119102164
a-invariants
[1, -1, 0, -666435151399264, 5847131931123119102164]
c-invariants
[31988887267164681, -5051921844540382202028645]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
108919763789045844740103310230126931479554
discriminant (Δ)
4173587508868658678751278641398003760433550172
Faltings height
7.4828
naive height
114.0125
primes of bad reduction
2, 7, 17, 23, 44884711987, 63329406057160191253919869
regulator
16789128430922159.44137558178765357984978568616462615563282218300268191
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,3,9,15,26,28,46,55,67,73: 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 16, proved: 16 independent points listed, matching the 2-descent upper bound. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.