Elliptic Curve Rank Leaderboard

curve #6481

y2 + xy + y = x3 − 880966362428x + 343791392248380062
a-invariants
[1, 0, 1, -880966362428, 343791392248380062]
c-invariants
[42286385396521, -297035826332178468565]
rank (lower bound)
≥ 14
torsion subgroup
trivial
conductor (N)
185468216178437434884828822672318
discriminant (Δ)
-7301141798080368061676171433318470388
Faltings height
5.8147
naive height
94.2808
primes of bad reduction
2, 3, 30911369363072905814138137112053
regulator
8138762136.36682788579547157657060776848139375534081781942791294637
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,15,21,30,41,53,79,86,104,121: 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 14, proved: 14 independent points listed, matching the 2-descent upper bound. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.