Elliptic Curve Rank Leaderboard

curve #6475

y2 + xy = x3 + x2 − 152403206204932x − 769565858610386540
a-invariants
[1, 1, 0, -152403206204932, -769565858610386540]
c-invariants
[7315353897836761, 664850036685140194915]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
37758135801974184873499473382852152425719842
discriminant (Δ)
226548814811845109240996840297112914554319052
Faltings height
7.2004
naive height
109.5863
primes of bad reduction
2, 3, 19469, 1625749, 198820953883898776903491784943147
regulator
25747623610011.21466951017132051774928875840215526523960695118164765300
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,10,45,69,71,80,88,94,100,111: 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 16, proved: 16 independent points listed, matching the 2-descent upper bound. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.