BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:3089@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20191010T110000
DTEND;TZID=Europe/Paris:20191010T120000
DTSTAMP:20190925T090000Z
URL:https://www.i2m.univ-amu.fr/evenements/solving-ax-p-by-p-cz-p-with-abc
 -containing-an-arbitrary-number-of-prime-factors/
SUMMARY: (...): Solving aX^p + bY^p = cZ^p with abc containing an arbitrary
  number of prime factors
DESCRIPTION:: Eduardo SOTO (Universitat de Barcelona) Let a\,b\,c be non-ze
 ro integers. The Asymptotic Fermat Conjecture (AFC) with coefficients a\,b
 \,c predicts that the total set of rational points of aX^p + b Y^p + c Z^p
 =0 for p ranging over the set of primes can be achieved in a finite set P_
 {a\,b\,c} of exponents p.This conjecture is connected to the theory of ell
 iptic curves due to Mazur and Frey.The first cases of the conjecture were 
 stablished by Wiles\, Serre\, Mazur\, Frey\, Ribet or Kraus via the modula
 rity method and S-unit equations. In this talk we will give an introductio
 n to the topic\, i.e. elliptic curves\, S-unit equations and modularity.We
  shall exhibit a further study of the S-unit equation that allows us to pr
 ove AFC for abc containing an arbitrary number of prime factors.This is jo
 int work with Luis Dieulefait (Universitat de Barcelona).https://www.resea
 rchgate.net/profile/Eduardo_Soto9
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20190331T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR