Elliptic Curve Rank Leaderboard

curve #6125

y2 + xy + y = x3 − x2 − 811621691337296202x + 277877419639547815275613065
a-invariants
[1, -1, 1, -811621691337296202, 277877419639547815275613065]
c-invariants
[38957841184190217681, -240086090393259027069273708825]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
20204071657297644439135497567378652495054663514
discriminant (Δ)
859668055556128483056597191597790994917899651413737472
Faltings height
9.1527
naive height
135.3270
primes of bad reduction
2, 7, 53, 256496329586693513, 15165467407429906830935137
regulator
2513625068873262007.82174940310712273154958292365100082344025551564138208
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,24,32,57,72,89,102,103,118: 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.