NSF-CBMS Conference on Additive Combinatorics from a Geometric Viewpoint

SURVEYS:

• Zeev Dvir, Incidence Theorems and Their Applications:
  https://arxiv.org/abs/1208.5073
• Gyogy Elekes, Sums versus products in Number Theory, Algebra and Erdös Geometry:
  http://www.cs.elte.hu/~elekes/survey.USletter.ps.gz
  http://people.math.sc.edu/laszlo/Elekessurvey.pdf
• Larry Guth, Polynomial Methods in Combinatorics, AMS:
  https://bookstore.ams.org/ulect-64/
  also: Lecture Notes MIT:
  https://ocw.mit.edu/courses/mathematics/18-s997-the-polynomial-method-fall-2012/lecture-notes/
• Frank de Zeeuw, A course on sum-product bounds:
  https://dcg.epfl.ch/files/content/sites/dcg/files/courses/2017%20-%20Additive%20Combinatorics/SumProductBounds_20170529.pdf

PAPERS:

• Noga Alon, Combinatorial Nullstellensatz:
  http://www.cs.tau.ac.il/~nogaa/PDFS/null2.pdf
• Gyula Karolyi, A compactness argument in the additive theory and the polynomial method, Open access:
  https://www.sciencedirect.com/science/article/pii/S0012365X05002931
• Jordan S. Ellenberg, Dion Gijswijt, On large subsets of F^n_q with no three-term arithmetic progression:
  https://arxiv.org/abs/1605.09223
• Imre Ruzsa, An infinite Sidon sequence:
  https://users.renyi.hu/~ruzsa/cikkek/densidon.dvi
• O. E. Raz, M. Sharir and J. Solymosi, Polynomials vanishing on grids: The Elekes-Ronyai problem revisited:
  http://arxiv.org/pdf/1401.7419.pdf
• Laszlo Szekely, Crossing Numbers and Hard Erdős Problems in Discrete Geometry:
  http://people.math.sc.edu/laszlo/szt2.pdf