Elliptic Curve Rank Leaderboard

curve #6020

y2 + y = x3 − 28153341138661675x + 1814372863373355693034056
a-invariants
[0, 0, 1, -28153341138661675, 1814372863373355693034056]
c-invariants
[1351360374655760400, -1567618153954579318781424600]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
45610300416068014360512834699213194395225
discriminant (Δ)
6014854946596438188691553037496137569880717233125
Faltings height
8.2383
naive height
125.2429
primes of bad reduction
5, 7, 13, 67369, 28677907, 10377051661414102592492953
regulator
329668009727457.4191354951278592022211293277874621828259299037639163391
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,19,21,28,33,44,55,65,77: 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.