• About
  • Members
  • Seminar
  • Visitors
  • Publications
  • Conferences
  • Magma
  • Login
Computational Algebra Group
Computational Algebra Seminar
  • 2000-2004
  • 2005-2009
  • 2010-2014
  • 2015
  • 2016
  • 2017
  • 2018
  • 2024
  • 2025
  • Steve Donnelly
  • (University of Sydney)
  • Descent algorithms for elliptic curves, Part 1
  • 3pm–4pm, Thursday 3rd June, 2010
  • Carlaw 535
  • I'll begin a short series of talks outlining the theory of the descent algorithms implemented in Magma, whose purpose is to determine the group of rational points on a given elliptic curve.

    (For elliptic curves over ℚ, we have 2-descent, 4-descent and now full-fledged 8-descent; alongside this, we have 3-descent and now 6- and 12-descent. Complementary to 4- and 8-descent, we have the Cassels-Tate pairing for 2- and 4-coverings.)

    The first talk will describe 2-descent from an elementary point of view, so it will be accessible and will lay the foundations for the remaining talks.

The Computational Algebra Group is a research group within the School of Mathematics and Statistics, University of Sydney.
Copyright © 2010-2025 Computational Algebra Group.