Explicit n-descent on elliptic curves III. Algorithms


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 curves of degree n in Pn−1. 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.

DOI: 10.1090/S0025-5718-2014-02858-5

Extracted Key Phrases

Cite this paper

@article{Cremona2015ExplicitNO, title={Explicit n-descent on elliptic curves III. Algorithms}, author={John Cremona and T. A. Fisher and C. O'Neil and D. Simon and M. Stoll}, journal={Math. Comput.}, year={2015}, volume={84}, pages={895-922} }