Elliptic Curve Rank Leaderboard

curve #6101

y2 + xy + y = x3 − x2 − 56218417291767046322x + 160932505855565946370965000625
a-invariants
[1, -1, 1, -56218417291767046322, 160932505855565946370965000625]
c-invariants
[2698484030004818223441, -139045685047065799529492078534745]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
15042348617841095595823355422402529435108652138
discriminant (Δ)
182964014843935538155341625068220986965911853390976374341632
Faltings height
10.1927
naive height
148.0409
primes of bad reduction
2, 3, 11, 313, 6271, 55441, 2174741, 321018989709898828986366637
regulator
134341422699397113058.554611561303551637181914443484032584412709827115853
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,3,30,44,85,98,101,106,118,127: 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 17, proved: 17 independent points listed, matching the 2-descent upper bound. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.