Elliptic Curve Rank Leaderboard

curve #6183

y2 + xy = x3 − 69283937711206345x + 7369712716702797558539801
a-invariants
[1, 0, 0, -69283937711206345, 7369712716702797558539801]
c-invariants
[3325629010137904561, -6367431792219660605785244905]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
29109434091169948293553656515843844039762
discriminant (Δ)
-2177875148181136300520044234649013726059485978165248
Faltings height
8.6065
naive height
128.0420
primes of bad reduction
2, 3, 29, 595207, 281071288182287246899399535819209
regulator
714489547613882627.7294154584799142406449441296494732053126403111618102
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,6,11,52,54,67,71,75,128,140: 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.