Elliptic Curve Rank Leaderboard

curve #6022

y2 + xy + y = x3 − x2 − 1054797287346299097x + 415756575388380435193851321
a-invariants
[1, -1, 1, -1054797287346299097, 415756575388380435193851321]
c-invariants
[50630269792622356641, -359213680907724481940686936689]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
1653535489753497367005066448469162613580430
discriminant (Δ)
435411610818674532275561305317217450068180556288000000
Faltings height
9.1567
naive height
136.1132
primes of bad reduction
2, 5, 37, 139, 42923, 294563, 442953261827, 5740779015797887
regulator
74858446729909.35099432563094123847526469104775526969200245848746945598
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,10,24,32,36,47,49,51,72: 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.