Elliptic Curve Rank Leaderboard

curve #6480

y2 + y = x3 − 12781605705687x + 17521041577408378346
a-invariants
[0, 0, 1, -12781605705687, 17521041577408378346]
c-invariants
[613517073872976, -15138179922880838891160]
rank (lower bound)
≥ 14
torsion subgroup
trivial
conductor (N)
155339352465722439837472406302227
discriminant (Δ)
1021584746649602119640381993346813100917
Faltings height
6.3375
naive height
102.1507
primes of bad reduction
3, 11, 61, 419, 61390679147878661349388247
regulator
43923218976.5604185270230936023729307766716167676869965794918791191
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,14,26,34,60,62,66,78,97,113: 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.