Elliptic Curve Rank Leaderboard

curve #6017

y2 + xy + y = x3 − x2 − 504581196225963782x + 144777954426292433473765525
a-invariants
[1, -1, 1, -504581196225963782, 144777954426292433473765525]
c-invariants
[24219897418846261521, -125088152515327124136525236985]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
3877468398357428055736663961087371709872782
discriminant (Δ)
-833085055458646556236758693317513896880810837416869888
Faltings height
9.1024
naive height
133.9976
primes of bad reduction
2, 3, 7, 59, 14029, 37179110483154681871811441827026887
regulator
6367756631810670.921758079272559177658031554567260139245615520801682741
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,3,19,22,38,47,49,51,53,72: 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 the sum of -a_p log(p)/p over 5 <= p <= 199 (with early abort on low partial sums); the sets scoring at least 31 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.