Elliptic Curve Rank Leaderboard

curve #6122

y2 + xy + y = x3 − x2 − 15793126247508684444x + 24154450924865994000420817119
a-invariants
[1, -1, 1, -15793126247508684444, 24154450924865994000420817119]
c-invariants
[758070059880416853297, -20869445595672903546901710151209]
rank (lower bound)
≥ 18
torsion subgroup
trivial
conductor (N)
133189757005333373984927132272779327740156243097818
discriminant (Δ)
61646612650404541482175553318191366285875836805338865664
Faltings height
9.7213
naive height
144.2319
primes of bad reduction
2, 113, 2411, 151830629, 2226833419654303, 6397931882288571973
regulator
119652716301597166823793.46205957175763553463496204566753775219499364698818
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,3,5,19,44,45,68,83,90,113: 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 18, proved: 18 independent points listed, matching the 2-descent upper bound. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.