Elliptic Curve Rank Leaderboard

curve #6134

y2 = x3 − 14229968401227999x + 653439584737276973104066
a-invariants
[0, 0, 0, -14229968401227999, 653439584737276973104066]
c-invariants
[683038483258943952, -564571801213007304761913024]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
92078813233509391764925470080562121674696
discriminant (Δ)
-43676295953929910852207687776133514546688601856
Faltings height
7.9673
naive height
123.1962
primes of bad reduction
2, 3, 61, 1163713, 549450332688841, 32788613704170461
regulator
1968292446030769.512723719808331036231541629651249416484095977455984301
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,21,23,24,30,47,59,61,70,95: 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.