Elliptic Curve Rank Leaderboard

curve #6172

y2 + xy = x3 − 227781760006021270350x + 1239644962466450800403457742596
a-invariants
[1, 0, 0, -227781760006021270350, 1239644962466450800403457742596]
c-invariants
[10933524480289020976801, -1071053247587413778269021021068145]
rank (lower bound)
≥ 18
torsion subgroup
trivial
conductor (N)
921696670794521859371340115713061536866663911815042
discriminant (Δ)
92511493199181681140867470244016054332096813848356245845819392
Faltings height
10.6375
naive height
152.2384
primes of bad reduction
2, 3, 7, 10463, 2097405985705915765239278809485264484980325027
regulator
3751194039769578587125.7650982939562058037311580917546064443748586479716523
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,8,18,22,27,35,49,65,71,103: 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 18, proved: 18 independent points listed, matching the 2-descent upper bound. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.