Elliptic Curve Rank Leaderboard

curve #6476

y2 = x3 − x2 − 16669458902308x + 27036894787183084612
a-invariants
[0, -1, 0, -16669458902308, 27036894787183084612]
c-invariants
[800134027310800, -23359872295322021240000]
rank (lower bound)
≥ 15
torsion subgroup
trivial
conductor (N)
322398322749244260811230752852826600
discriminant (Δ)
-19343899364954655648673845171169596000000
Faltings height
6.5005
naive height
103.0106
primes of bad reduction
2, 3, 5, 21247, 20054201, 1261068106038586980913
regulator
892629286071.47890220853646057883493408371901623000430649207432530434
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,3,22,26,47,68,87,105,107,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 15, proved: 15 independent points listed, matching the 2-descent upper bound. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.