The conference will run from Monday to Friday, and there will be no talks scheduled on Wednesday afternoon.

For those who have pre-registered, the conference dinner will take place at the Louvre on Wednesday evening. For detailed instructions on how to get there, please see the conference booklet.

An overview of the programme in pdf format is available for download here.


  • 8:30-9:30: Registration and Welcome
  • 9:30-10:30: Noga Alon, Tel Aviv University: The chromatic number of random Cayley graphs. [slides]
  • 11:00-11:30: Jacob Fox, Massachusetts Institute of Technology: Sparse graphs and arithmetic removal lemmas. [slides]
  • 11:30-12:00: Juanjo Rué, Universidad Autónoma de Madrid: Lower bounds for sums of dilates. [slides]
  • 14:00-15:00: Oriol Serra, Universitat Politècnica de Catalunya: Yahya ould Hamidoune and additive combinatorics. [slides]
  • 15:00-15:30: Tom Sanders, University of Oxford: A non-abelian Kneser-type theorem.
  • 15:30-16:00: Gilles Zémor, Université Bordeaux I: A structure theorem for small sumsets in non-abelian groups. [slides]
  • 16:30-17:00: Norbert Hegyvári, Eötvös Loránd University Budapest: Iterated additive operations. [slides]
  • 17:00-17:30: Máté Matolcsi, Rényi Institute: Difference sets and positive exponential sums. [slides] [arXiv]


  • 9:00-10:00: Ben Green, University of Cambridge: Applications of additive combinatorics to some problems in combinatorial geometry.
  • 10:00-10:30: Ernie Croot, Georgia Institute of Technology: Rich Lines in General Position in Grids. [slides]
  • 11:00-11:30: Trevor Wooley, University of Bristol: Vinogradov’s mean-value theorem and concentration in arithmetic progressions. [slides]
  • 11:30-12:00: Jozsef Solymosi, University of British Columbia: Roth-type theorems in finite groups. [arXiv]
  • 14:00-15:00: Benny Sudakov, University of California Los Angeles: Induced matchings, arithmetic progressions and linearity testing. [arXiv]
  • 15:00-15:30: Miklós Simonovits, Rényi Institute: When do we have many triple points for 1-parameter families of curves?
  • 15:30-16:00: Harald Helfgott, CNRS, Ecole normale supérieure: On the diameter of permutation groups. [slides] [arXiv]
  • 16:30-17:00: David Grynkiewicz, Universität Graz: Large sumsets and the isoperimetric method.
  • 17:00-17:30: Susana Lopez, Universitat Politècnica de Catalunya: Large restricted sumsets in general abelian groups. [slides]


  • 9:00-10:00: Mel Nathanson, CUNY Graduate Center: Problems and results in additive number theory.
  • 10:00-10:30: Christian Elsholtz, Technische Universitat Graz: Some multidimensional problems in additive combinatorics.
  • 11:00-11:30: Jean-Marc Deshouillers, Université de Bordeaux I: A heuristic remark on the set of integers for which the sums of the digits in different prime bases are equal.
  • 11:30-12:00: Antal Balog, Rényi Institute: A sum-product estimate in finite fields. [slides]
  • 12:00-12:30: François Hennecart, Université Jean Monnet, Saint-Etienne: On expanding binary functions.
  • 12:30-13:00: Michael Bateman, University of California Los Angeles: Rectangles and sum-product theorems. [slides]


  • 9:00-10:00: Tim Gowers, University of Cambridge: Freiman homomorphisms on sparse random sets.
  • 10:00-10:30: Endre Szemerédi, Rutgers University and Rényi Institute: On subset sums.
  • 11:00-11:30: Laurent Habsieger, CRM Montréal: On finite additive bases. [notes]
  • 11:30-12:00: Andrew Granville, Université de Montréal: Beyond heuristics: finding out when the sieve works using additive combinatorics. [slides]
  • 14:00-15:00: Tamar Ziegler, Technion: On the Möbius randomness principle.
  • 15:00-15:30: Seva Lev, University of Haifa: The edge-isoperimetric problem for Cayley graphs and the generalized Takagi function. [slides] [arXiv]
  • 15:30-16:00: Javier Cilleruelo, Universidad Autónoma de Madrid: Dense infinite B_h sequences. [slides] [arXiv] [blog]
  • 16:30-17:00: Gyula Károlyi, Eötvös Loránd University Budapest: The exterior algebra method in additive combinatorics.
  • 17:00-17:30: Gautami Bhowmik, Université Lille 1: Lattice polyhedra in additive combinatorics. [slides]


  • 9:00-10:00: Alfred Geroldinger, Universität Graz: Arithmetic of Krull monoids. [slides]
  • 10:00-10:30: Yonutz Stanchescu, Afeka Academic College, Tel Aviv: Inverse additive number theory and non-abelian groups.
  • 11:00-11:30: David Conlon, University of Oxford: Applications of transference in random sets.
  • 11:30-12:00: Tim Austin, Clay Mathematics Institute/Brown/NYU: Partial difference equations over compact abelian groups.
  • 14:00-15:00: Emmanuel Breuillard, Université Paris-Sud (Orsay): On the structure of sets with small doubling in arbitrary groups.
  • 15:00-15:30: Sukumar Das Adhikari, HRI Allahabad: Some weighted zero-sum problems. [slides]
  • 15:30-16:00: Jan-Christoph Schlage-Puchta, Universiteit Gent: Zero-sums of medium length.
  • 16:30-17:00: Simon Griffiths, IMPA Rio de Janeiro: Tight bounds on subset sums in abelian groups. [slides]