Elliptic Curve Rank Leaderboard

curve #6095

y2 = x3 − 143352735666059647x + 20308350490107193886372290
a-invariants
[0, 0, 0, -143352735666059647, 20308350490107193886372290]
c-invariants
[6880931311970863056, -17546414823452615517825658560]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
837877902601733961103246999529573248471046104
discriminant (Δ)
10368209505862013472789264367074766259536161835862272
Faltings height
8.7554
naive height
130.1259
primes of bad reduction
2, 17, 23, 43, 4447, 8822239, 9340081529363221267876573591
regulator
102081371964861448757.346950941231692484623413216399223990417493970261364
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,19,23,31,37,51,57,81,93,112: 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.