Elliptic Curve Rank Leaderboard

curve #6100

y2 + xy = x3 − 376611199004264288295x + 2882549262493214037198461362761
a-invariants
[1, 0, 0, -376611199004264288295, 2882549262493214037198461362761]
c-invariants
[18077337552204685838161, -2490522562821252934467777646182745]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
13406169159886136449996482619880669444469797358
discriminant (Δ)
-170837438297692389492480085766629110687115306414695147713691648
Faltings height
10.7206
naive height
153.7956
primes of bad reduction
2, 3, 7, 11, 19, 41, 7519095045599, 4954042034786895640115339629
regulator
25934491367920437015.9624329966909241210536010521313989485511187287986418
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,8,14,30,54,72,101,108,109,130: 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.