Elliptic Curve Rank Leaderboard

curve #6108

y2 + xy + y = x3 − x2 − 41074811655171797x + 3318666560927794288069165
a-invariants
[1, -1, 1, -41074811655171797, 3318666560927794288069165]
c-invariants
[1971590959448246241, -2867327899769454947374650705]
rank (lower bound)
≥ 16
torsion subgroup
trivial
conductor (N)
195243106761946482026935784782118626756674
discriminant (Δ)
-322718899359454852096465799014587248142916564205568
Faltings height
8.4583
naive height
126.4464
primes of bad reduction
2, 3, 47, 53, 4354411587536163121168111529999523323
regulator
7184308823105452.422823727165432454675399174899252455479928641767597563
submitted by
Michael Rubinstein
submitted at
last updated

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

Commentary

Mestre ten-root construction, roots 0,6,65,67,72,84,94,120,123,137: 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 16, proved: 16 independent points listed, matching the 2-descent upper bound. Torsion trivial.

last edited by Michael Rubinstein at · history

Log in to edit commentary.