16:00
Higher descent on elliptic curves
Abstract
Let E be an elliptic curve over a number field K and n≥2 an integer. We recall that elements of the n-Selmer group of E/K can be explicitly written in terms of certain equations for n-coverings of E/K. Writing the elements in this way is called conducting an explicit n-descent. One of the applications of explicit n-descent is in finding generators of large height for E(K) and from this point of view one would like to be able to take n as large as possible. General algorithms for explicit n-descent exist but become computationally challenging already for n≥5. In this talk we discuss combining n- and (n+1)-descents to n(n+1)-descent and the role that invariant theory plays in this procedure.