Elliptic Curve Rank Leaderboard

curve #6494

y2 + xy + y = x3 − x2 − 2341813627836153331412x + 43929609726043057225931293594295
a-invariants
[1, -1, 1, -2341813627836153331412, 43929609726043057225931293594295]
c-invariants
[112407054136135359907761, -37955182802795369699592028545886185]
rank (lower bound)
≥ 19
torsion subgroup
trivial
conductor (N)
275993669292054687436741062820989156987142998942730458
discriminant (Δ)
-11744155107108712633724189089819326917844926506042596750627176448
Faltings height
11.1205
naive height
159.2434
primes of bad reduction
2, 3, 167, 10600957, 8660940822751677874735696528448967274511599
regulator
117240687046943376.4442596274355971032016844565085835990997415473934405642927
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,33,59,60,83,98,114,117,134,186: 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); for the sets with S >= 31, or S >= 30 and one bad prime in that range, or S >= 29 and two or more bad primes, rational points were found by a point search on the quartic y^2 = r(x), and the curves were screened by conductor and by a GRH explicit-formula upper bound on the rank. Rank >= 19: the 19 listed points come from the point search and are independent (height matrix nonsingular at 57 and 115 digits). Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.