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

–
Coffee and Check-In
–
Opening Remarks
–
Algorithmic Dense Model Theorems and Weak Regularity
Russell Impagliazzo, UC San Diego
–
Sum of Squares Lower Bounds for Refuting Any CSP
Ryan O'Donnell, Carnegie Mellon University
–
Break
–
What Can Infinity Tell Us about the Finite?
Maryanthe Malliaris, University of Chicago
–
Lunch
–
Large Deviations for Arithmetic Progressions
Yufei Zhao, University of Oxford
–
Break
–
Trading Information Complexity for Error
Hamed Hatami, McGill University
–
Sparse Dense Dichotomy and Liquid Graphs
Jarik Nesetril, Charles University
–
Coffee and Check-In
–
The Entropy Decrement Method and the Erdos Discrepancy Problem
Terry Tao, UCLA
–
Break
–
Vinogradov's Three Primes Theorem with Primes from Special Sets
Kaisa Matomäki, University of Turku
–
Lunch
–
Additive Structure of Sets of Fourier Coefficients
Thomas Bloom, University of Bristol
–
Break
–
On Structural Properties of Low Threshold Rank Graphs
Shayan Oveis-Gharan, University of Washington
–
Open Problem Session
–
Coffee and Check-In
–
Hidden Irregularity Versus Hidden Structure: The Emergence of the Johnson Graphs
Laszlo Babai, University of Chicago
–
Break
–
Hidden Irregularity Versus Hidden Structure: The Emergence of the Johnson Graphs
Laszlo Babai, University of Chicago
–
Lunch
–
Random High-Dimensional Combinatorial Objects
Nati Linial, Hebrew University of Jerusalem
–
Free Afternoon
–
Coffee and Check-In
–
Positional Games and Randomness
Michael Krivelevich, Tel Aviv University
–
Break
–
The Independence Number of the Birkhoff Polytope Graph, and Applications to Coding Theory
Shachar Lovett, UC San Diego
–
Lunch
–
Partitioning to Sumsets Vs. Subspaces via Entropy Decrement
Kaave Hosseini, UC San Diego
–
Tight Bounds for Arithmetic Progressions with Popular Common Differences in Dense Sets
Huy Pham, Stanford University
–
Break
–
Outlaw Distributions and Locally Decodable Codes
Sivakanth Gopi, Princeton University
–
Twenty (Simple) Questions (and Hitting Maximal Antichains)
Shay Moran, Simons Institute and UC San Diego
–
Reception
–
Coffee and Check-In
–
Unavoidable Patterns in Words
David Conlon, University of Oxford
–
Break
–
True Complexity of Multilinear Systems
Freddie Manners, Stanford University