Elliptic Curve Rank Leaderboard

curve #6468

y2 + xy + y = x3 − x2 − 14701074255147819661142x + 668340710580824264426435539400805
a-invariants
[1, -1, 1, -14701074255147819661142, 668340710580824264426435539400805]
c-invariants
[705651564247095343734801, -577446373938656732425328376995489145]
rank (lower bound)
≥ 19
torsion subgroup
trivial
conductor (N)
10883578061541468914591934184166771949462813702546719742
discriminant (Δ)
10376585390636390892311839439864587208459077840846239496217554747392
Faltings height
11.6363
naive height
164.7402
primes of bad reduction
2, 3, 13, 109, 6113262985406879, 69800134932133388125350454276890833
regulator
311780962404780454.8649661909433819425125693159743154142188947322967534526712
submitted by
Michael Rubinstein
submitted at
last updated

Witness: 19 independent points log in to add more points →

Commentary

Mestre ten-root construction, roots 0,6,12,33,41,43,56,65,78,114: 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 19, proved: 19 independent points listed, matching the 2-descent upper bound. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.