Journée-séminaire de combinatoire

(équipe CALIN du LIPN, université Paris-Nord, Villetaneuse)

Le 29 octobre 2019 à 14h00 en B107, Pierre-Yves Bienvenu nous parlera de : The Green-Tao theorem and polynomial configurations in the primes

Résumé : Green and Tao famously proved that the set of primes contains arbitrarily long arithmetic progressions. We will explain the heavy machinery behind the Green-Tao theorem and explains why polynomial configurations are much harder than linear ones and what can still be done for them. We will also discuss other extensions of the Green-Tao theorem.

 [arXiv]


Dernière modification : Friday 25 October 2019 Valid HTML 4.01! Valid CSS! Contact : Cyril.Banderier at lipn.univ-paris13.fr