Skip to main content

Arithmetic Geometry, ECM, Krakow, Poland, 2012

Arithmetic Geometry Minisymposium


  • Wojciech Gajda, Adam Mickiewicz University, Poznan, Poland.
  • Samir Siksek, University of Warwick, UK.


This minisymposium is part of the 6th European Congress of Mathematics, Kraków, Poland, July 2-7, 2012.


If you plan to attend the minisymposium, please register for the ECM.

Invited Speakers

  • Sander Dahmen (Utrecht)
  • Tim Dokchitser (Bristol)
  • Michael Stoll (Bayreuth)
  • Szabolcs Tengely (Debrecen)

Titles and Abstracts

  • Sander Dahmen, Klein forms and the generalized superelliptic equation

    Abstract: Let F be a binary form over the integers and consider the exponential Diophantine equation F(x,y)=z^n with x and y coprime. For general F it seems very difficult to solve this equation, but as we will explain in this talk, for so-called Klein forms F, the modular method can provide a good starting point. Together with solving certain infinite families of Thue equations, we can show in particular, that there exist infinitely many (essentially different) cubic forms F for which the equation above has no solutions for large enough exponent n. This is joint work with Mike Bennett.

  • Tim Dokchitser, Parity conjecture for elliptic curves
    Abstract: This is an overview talk about the Birch-Swinnerton-Dyer conjecture and the p-Parity Conjecture for elliptic curves. I will explain what they are about, what is known, and some of the mysterious consequences of the conjectures. Finally, I will say a few words about the proof of the p-Parity Conjecture for elliptic curves over the rationals, and why finiteness of Sha implies it over general number fields as well. This is joint work with Vladimir Dokchitser.
  • Michael Stoll, Rational points on curves

    Abstract: Mordell conjectured, and Faltings proved, that an algebraic curve over the rational numbers and of genus at least two can only have finitely many rational points. All known proofs of this statement are ineffective: they do not provide an algorithm that determines this finite set. I will give an overview of methods that can be used in many cases (although they are not guaranteed to work) and are frequently successful, as demonstrated by many examples.

  • Szabolcs Tengely, Composite rational functions

    Abstract: In this talk we consider rational functions f=P/Q with a bounded number of zeros and poles. There is a variety such that points on the variety lead to solutions of the equation f(x)=g(h(x)) where g and h are rational functions. We use this to characterize all composite rational functions having at most 4 distinct zeroes and poles. This is joint work with Attila Pethoe.