Workshops

Spring 2017

Structure vs. Randomness

Apr 10, 2017 to Apr 14, 2017

Return to event »

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

Monday, April 10th, 2017
9:00 am–9:20 am		Coffee and Check-In
9:20 am–9:30 am		Opening Remarks
9:30 am–10:00 am		Algorithmic Dense Model Theorems and Weak Regularity Russell Impagliazzo, UC San Diego
10:00 am–10:30 am		Sum of Squares Lower Bounds for Refuting Any CSP Ryan O'Donnell, Carnegie Mellon University
10:30 am–11:00 am		Break
11:00 am–12:00 pm		What Can Infinity Tell Us about the Finite? Maryanthe Malliaris, University of Chicago
12:00 pm–2:00 pm		Lunch
2:00 pm–3:00 pm		Large Deviations for Arithmetic Progressions Yufei Zhao, University of Oxford
3:00 pm–3:30 pm		Break
3:30 pm–4:00 pm		Trading Information Complexity for Error Hamed Hatami, McGill University
4:00 pm–4:30 pm		Sparse Dense Dichotomy and Liquid Graphs Jarik Nesetril, Charles University

Tuesday, April 11th, 2017
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:30 am		The Entropy Decrement Method and the Erdos Discrepancy Problem Terry Tao, UCLA
10:30 am–11:00 am		Break
11:00 am–12:00 pm		Vinogradov's Three Primes Theorem with Primes from Special Sets Kaisa Matomäki, University of Turku
12:00 pm–2:00 pm		Lunch
2:00 pm–3:00 pm		Additive Structure of Sets of Fourier Coefficients Thomas Bloom, University of Bristol
3:00 pm–3:30 pm		Break
3:30 pm–4:00 pm		On Structural Properties of Low Threshold Rank Graphs Shayan Oveis-Gharan, University of Washington
4:00 pm–5:00 pm		Open Problem Session

Wednesday, April 12th, 2017
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:30 am		Hidden Irregularity Versus Hidden Structure: The Emergence of the Johnson Graphs Laszlo Babai, University of Chicago
10:30 am–11:00 am		Break
11:00 am–12:00 pm		Hidden Irregularity Versus Hidden Structure: The Emergence of the Johnson Graphs Laszlo Babai, University of Chicago
12:00 pm–2:00 pm		Lunch
2:00 pm–3:00 pm		Random High-Dimensional Combinatorial Objects Nati Linial, Hebrew University of Jerusalem
3:00 pm–5:00 pm		Free Afternoon

Thursday, April 13th, 2017
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:30 am		Positional Games and Randomness Michael Krivelevich, Tel Aviv University
10:30 am–11:00 am		Break
11:00 am–12:00 pm		The Independence Number of the Birkhoff Polytope Graph, and Applications to Coding Theory Shachar Lovett, UC San Diego
12:00 pm–2:00 pm		Lunch
2:00 pm–2:30 pm		Partitioning to Sumsets Vs. Subspaces via Entropy Decrement Kaave Hosseini, UC San Diego
2:30 pm–3:00 pm		Tight Bounds for Arithmetic Progressions with Popular Common Differences in Dense Sets Huy Pham, Stanford University
3:00 pm–3:30 pm		Break
3:30 pm–4:00 pm		Outlaw Distributions and Locally Decodable Codes Sivakanth Gopi, Princeton University
4:00 pm–4:30 pm		Twenty (Simple) Questions (and Hitting Maximal Antichains) Shay Moran, Simons Institute and UC San Diego
4:30 pm–6:00 pm		Reception

Friday, April 14th, 2017
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:30 am		Unavoidable Patterns in Words David Conlon, University of Oxford
10:30 am–11:00 am		Break
11:00 am–12:00 pm		True Complexity of Multilinear Systems Freddie Manners, Stanford University