• Click on the titles of individual talks for abstract, slides and archived video.

All events take place in the Calvin Lab Auditorium.

–
Coffee and Check-In
–
Opening Remarks
–
Threshold, Influence, Noise, and Discrete Harmonic Analysis
Gil Kalai (Hebrew University of Jerusalem)
–
Questions/Discussion/Break
–
Structure of the Fourier Spectrum of Boolean Functions and Complexity
Ben Lee Volk, Technion Israel Institute of Technology
–
Questions/Discussion
–
Lunch Break
–
Quantitative Aspects of the Idempotent Theorem
Tom Sanders, University of Oxford
–
Questions/Discussion/Break
–
Families of Permutations with Forbidden Intersection-sizes
David Ellis, Weizmann Institute of Science and Queen Mary, University of London
–
Questions/Discussion/Break
–
Friedgut-Kalai-Naor for Boolean Functions on S_n
Yuval Filmus (Technion - Israel Institute of Technology)
–
Questions/Discussion
–
Coffee and Check-In
–
A Short Proof of Gowers' Lower Bound for the Regularity Lemma
Asaf Shapira, Tel Aviv University
–
Questions/Discussion/Break
–
Carries and Cocycles
Persi Diaconis, Stanford University
–
Questions/Discussion
–
Lunch Break
–
The Green-Tao Theorem and a Relative Szemeredi Theorem
Yufei Zhao, Massachusetts Institute of Technology
–
Questions/Discussion/Break
–
Algorithmic Regularity for Polynomials and Applications
Arnab Bhattacharyya, Indian Institute of Science
–
Questions/Discussion
–
Reception
–
Coffee and Check-In
–
Ultraproducts as a Bridge Between Discrete and Continuous Analysis
Terry Tao, UCLA
–
Questions/Discussion/Break
–
Undecidability of Linear Inequalities Between Graph Homomorphism Densities
Hamed Hatami (McGill University)
–
Questions/Discussion
–
Lunch Break
–
Non-commutative Computation
Avi Wigderson (Institute for Advanced Study, Princeton)
–
Questions/Discussion/Break
–
Small Lifts of Expander Graphs are Expanding
Alexandra Kolla (UC Santa Cruz)
–
Questions/Discussion/Break
–
Building Monotone Expanders
Amir Yehudayoff, Technion Israel Institute of Technology
–
Questions/Discussion
–
Coffee and Check-In
–
The Structure of Low Rank Matrices
Shachar Lovett, UC San Diego
–
Questions/Discussion/Break
–
Counting Sumsets and Applications
Ben Green, University of Oxford
–
Questions/Discussion
–
Lunch Break
–
Incidence Geometry and Applications to Theoretical Computer Science
Shubhangi Saraf, Rutgers University
–
Questions/Discussion/Break
–
Laplacian Eigenvalues, Metric Uniformization, and Incidence Geometry
James Lee (University of Washington)
–
Questions/Discussion/Break
–
Hardness Amplification and the Approximate Degree of Constant-Depth Circuits
Justin Thaler (Georgetown University)
–
Questions/Discussion
–
Coffee and Check-In
–
Vertical Versus Horizontal Poincare Inequalities
Assaf Naor, Courant Institute, NYU
–
Questions/Discussion/Break
–
Partial Difference Equations Over Compact Abelian Groups
Tim Austin, Courant Institute, NYU
–
Questions/Discussion
–
Lunch Break
–
Some Pseudorandom Phenomena in Finite Fields
Swastik Kopparty, Rutgers University
–
Questions/Discussion/Break
–
Discrete Tori and Bounds for Linear Codes
Alex Samorodnitsky (Hebrew University of Jerusalem)
–
Questions/Discussion