• 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
  • Vladimir Dokchitser
  • (University of Cambridge)
  • Ranks of elliptic curves: parity phenomena
  • 3pm–4pm, Thursday 23rd September, 2010
  • Carslaw 535
  • It is in general very difficult to compute ranks of elliptic curves over number fields, even if equipped with any conjectures that are available. On the other hand, the parity of the rank is (conjecturally) very easy to determine — it is given as a sum of purely local terms, which have a reasonably simple classification. Since "odd rank" implies "non-zero rank" implies "the curve has infinitely many points", this leads to a number of (conjectural!) arithmetic phenomena.

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