Elliptic Curve Rank Leaderboard

curve #6069

y2 + xy = x3 − x2 − 230685453317905775709x + 1257046703414879260209833270465
a-invariants
[1, -1, 0, -230685453317905775709, 1257046703414879260209833270465]
c-invariants
[11072901759259477234041, -1086088351700627622904628298128589]
rank (lower bound)
≥ 17
torsion subgroup
trivial
conductor (N)
74796929460358181130135996875568438477322157430
discriminant (Δ)
103038890251472901697685300828111131547570191894990683895312500
Faltings height
10.6442
naive height
152.2764
primes of bad reduction
2, 3, 5, 13, 37, 103, 7146311, 2347345661258664947141613502279799
regulator
48188017170914733113.7255820717139793444992906872271825056090036032731384
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,21,39,65,66,75,96,98,113: 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.