Elliptic Curve Rank Leaderboard

curve #6181

y2 + xy + y = x3 − x2 − 11787619440588782x + 492945352107197232466685
a-invariants
[1, -1, 1, -11787619440588782, 492945352107197232466685]
c-invariants
[565805733148261521, -425904781674492609684039225]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
6872032306498553291336308079119666264818
discriminant (Δ)
-150478375774377025107902066651028422048632946688
Faltings height
7.9808
naive height
122.6325
primes of bad reduction
2, 3, 11, 34707233871204814602708626662220536691
regulator
27503319688014276.13129319976274502113131922213220028379149488541455555
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,3,18,21,30,45,55,65,80,101: 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.