Elliptic Curve Rank Leaderboard

curve #6133

y2 + xy + y = x3 − x2 − 83944040996062112x + 9499994324931186677586755
a-invariants
[1, -1, 1, -83944040996062112, 9499994324931186677586755]
c-invariants
[4029313967810981361, -8207995078608632434285540425]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
66990644961370594294331709277299659581362
discriminant (Δ)
-1130657327131201185816591008387567774008199833179648
Faltings height
8.5942
naive height
128.5498
primes of bad reduction
2, 3, 7, 113, 28031, 39359, 4264641446277104227915783831
regulator
66192228708206164744.01302663565167163332924261104194115541626854222656
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,8,13,24,66,72,95,107,116,139: 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.