Explicit n-descent on elliptic curves. III. Algorithms
Cremona, John E., Fisher, Tom, O'Neil, Cathy, Simon, Denis and Stoll, Michael (2011) Explicit n-descent on elliptic curves. III. Algorithms. Working Paper. ArXiv e-prints. ArXiv e-prints (No.1107.3516v1).Full text not available from this repository.
Official URL: http://arxiv.org/pdf/1107.3516v1.pdf
This is the third in a series of papers in which we study the n-Selmer group of an elliptic curve, with the aim of representing its elements as genus one normal curves of degree n. The methods we describe are practical in the case n = 3 for elliptic curves over the rationals, and have been implemented in MAGMA.
One important ingredient of our work is an algorithm for trivialising central simple algebras. This is of independent interest: for example, it could be used for parametrising Brauer-Severi surfaces.
|Item Type:||Working or Discussion Paper (Working Paper)|
|Subjects:||Q Science > QA Mathematics|
|Divisions:||Faculty of Science > Mathematics|
|Series Name:||ArXiv e-prints|
|Official Date:||18 June 2011|
|Number of Pages:||42|
|Status:||Not Peer Reviewed|
|Access rights to Published version:||Open Access|
Actions (login required)
Downloads per month over past year