An algorithm for the rank of elliptic curves (Q1309131)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for the rank of elliptic curves |
scientific article; zbMATH DE number 468822
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for the rank of elliptic curves |
scientific article; zbMATH DE number 468822 |
Statements
An algorithm for the rank of elliptic curves (English)
0 references
8 March 1995
0 references
An asymptotic formula for the rank \(r\) of an elliptic curve \(E\) over the rationals \(\mathbb{Q}\) is given and a conjecture of \(S\). Lang on the size of the Néron-Tate height of basis points of the Mordell-Weil group \(E (\mathbb{Q})\) is claimed to lead to an algorithm for determining \(r\) provided Lang's conjecture is true and the constants involved can be effectively computed. No proofs are given. We mention that an algorithm for computing the rank \(r\) and a basis of the group \(E(\mathbb{Q})\), based on ideas of Manin and assuming the truth of the conjectures of Birch and Swinnerton-Dyer was developed by \textit{J. Gebel} and the reviewer [in Elliptic curves and related topics, CRM Proc. Lect. Notes 4, 61-83 (1994)].
0 references
asymptotic rank of an elliptic curve
0 references
Néron-Tate height of basis points of the Mordell-Weil group
0 references