Elliptic Curve Rank Leaderboard

curve #6442

y2 = x3 − 6228687308306417892x + 5406090867797520081415191300
a-invariants
[0, 0, 0, -6228687308306417892, 5406090867797520081415191300]
c-invariants
[298976990798708058816, -4670862509777057350342725283200]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
68703648682458326225449551581699878684569624 ★ record for rank ≥ 17
discriminant (Δ)
2840145690292606695657045392520724522361316133781151282432
Faltings height
9.7588
naive height
141.4407
primes of bad reduction
2, 3, 7, 11, 43, 47, 801833, 7959004901, 137261749107944340721
regulator
11560529572165.5972492292136214106607116458769008061633749607987710443595
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,2,14,18,33,44,97,106,120,136: 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 17, proved: the 17 listed points come from the point search and are independent, and the 2-descent upper bound (ellrank) is 17. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.