Algorithmic Number Theory

DOI10.1007/B98210MaRDI QIDQ5465639zbMATH OpenOpenAlexFDO

Authors Noam D. Elkies, Mark Watkins

Publication date 12 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0403374

Mathematics Subject Classification ID

Elliptic curves over global fields (11G05) Global ground fields in algebraic geometry (14G25)

Abstract: For r=6,7,...,11 we find an elliptic curve E/Q of rank at least r and the smallest conductor known, improving on the previous records by factors ranging from 1.0136 (for r=6) to over 100 (for r=10 and r=11). We describe our search methods, and tabulate, for each r=5,6,...,11, the five curves of lowest conductor, and (except for r=11) also the five of lowest absolute discriminant, that we found.

Recommendations

• scientific article; zbMATH DE number 3859298
• Finding rational points on elliptic curves using 6-descent and 12-descent
• Examples of elliptic curves over \(\mathbb{Q}\) with rank \(\geq 17\)
• Algorithmic Number Theory
• Ranks of elliptic curves

Cited in

(8)

• Computing elliptic curves over \(\mathbb {Q}\)
• Algorithmic Number Theory
• Reductions of points on elliptic curves
• Elliptic curves with conductor having $n$ prime factors
• From the Birch and Swinnerton-Dyer conjecture to Nagao's conjecture
• scientific article; zbMATH DE number 5688291 (Why is no real title available?)
• Computing Elliptic Curves over $$\mathbb{Q}$$ : Bad Reduction at One Prime
• Finding rational points on elliptic curves using 6-descent and 12-descent

This page was built for publication: Algorithmic Number Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5465639)