Elliptic Curve Rank Leaderboard

curve #6449

y2 + xy + y = x3 − x2 − 462229216700775066822x + 3292992848523606943193733248085
a-invariants
[1, -1, 1, -462229216700775066822, 3292992848523606943193733248085]
c-invariants
[22187002401637203207441, -2845145821024554888112018111912185]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
831896611260754035997450667257493457847065982
discriminant (Δ)
1635988019109418827711762446319038294652539423454037724393439232
Faltings height
10.8539
naive height
154.3614
primes of bad reduction
2, 11, 17, 19, 23, 43, 443063, 683290872278032605040564338731
regulator
41586334606869.4633418060307616199720175399776032242227561167120888372857
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,1,90,97,114,115,130,144,157,172: 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.