Elliptic Curve Rank Leaderboard

curve #6132

y2 + xy = x3 + x2 − 214690684828225x + 1234522870323369723625
a-invariants
[1, 1, 0, -214690684828225, 1234522870323369723625]
c-invariants
[10305152871754825, -1066627837248037979373125]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
6686283657824244240901969615219363968150
discriminant (Δ)
-25073563716840915903382386057072614880562500
Faltings height
7.1151
naive height
110.6531
primes of bad reduction
2, 3, 5, 44575224385494961606013130768129093121
regulator
1764317418809131.181308817390080488457486583816451509908691478157267111
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,4,22,53,58,70,101,121,133,138: 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.