Elliptic Curve Rank Leaderboard

curve #6026

y2 = x3 − 619728259344967827x + 186882502295807454600266850
a-invariants
[0, 0, 0, -619728259344967827, 186882502295807454600266850]
c-invariants
[29746956448558455696, -161466481983577640774630558400]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
3055278382854708194585081652179409474600432
discriminant (Δ)
145314929292065166595657696694406762076570337306330112
Faltings height
9.0438
naive height
134.5178
primes of bad reduction
2, 3, 7, 17, 10930743779, 1812379369747177366245439267
regulator
39087593875083.13516755449762418728637523422598578344441381345565295848
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,7,18,20,42,50,58,59,68,76: 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.