Workshops

Fall 2013

Neo-Classical Methods in Discrete Analysis

Dec 2, 2013 to Dec 6, 2013

Return to event »

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

All events take place in the Calvin Lab Auditorium.

Monday, December 2nd, 2013
9:00 am–9:20 am		Coffee and Check-In
9:20 am–9:30 am		Opening Remarks
9:30 am–10:15 am		Threshold, Influence, Noise, and Discrete Harmonic Analysis Gil Kalai, Hebrew University of Jerusalem
10:15 am–10:45 am		Questions/Discussion/Break
10:45 am–11:30 am		Structure of the Fourier Spectrum of Boolean Functions and Complexity Ben Lee Volk, Technion Israel Institute of Technology
11:30 am–11:45 am		Questions/Discussion
11:45 am–1:45 pm		Lunch Break
1:45 pm–2:30 pm		Quantitative Aspects of the Idempotent Theorem Tom Sanders, University of Oxford
2:30 pm–3:00 pm		Questions/Discussion/Break
3:00 pm–3:45 pm		Families of Permutations with Forbidden Intersection-sizes David Ellis, Weizmann Institute of Science and Queen Mary, University of London
3:45 pm–4:15 pm		Questions/Discussion/Break
4:15 pm–5:00 pm		Friedgut-Kalai-Naor for Boolean Functions on S_n Yuval Filmus, University of Toronto
5:00 pm–5:15 pm		Questions/Discussion

Tuesday, December 3rd, 2013
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:15 am		A Short Proof of Gowers' Lower Bound for the Regularity Lemma Asaf Shapira, Tel Aviv University
10:15 am–10:45 am		Questions/Discussion/Break
10:45 am–11:30 am		Carries and Cocycles Persi Diaconis, Stanford University
11:30 am–11:45 am		Questions/Discussion
11:45 am–1:45 pm		Lunch Break
1:45 pm–2:30 pm		The Green-Tao Theorem and a Relative Szemeredi Theorem Yufei Zhao, Massachusetts Institute of Technology
2:30 pm–3:00 pm		Questions/Discussion/Break
3:00 pm–3:45 pm		Algorithmic Regularity for Polynomials and Applications Arnab Bhattacharyya, Indian Institute of Science
3:45 pm–4:15 pm		Questions/Discussion
4:15 pm–5:15 pm		Reception

Wednesday, December 4th, 2013
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:15 am		Ultraproducts as a Bridge Between Discrete and Continuous Analysis Terry Tao, UCLA
10:15 am–10:45 am		Questions/Discussion/Break
10:45 am–11:30 am		Undecidability of Linear Inequalities Between Graph Homomorphism Densities Hamed Hatami, McGill University
11:30 am–11:45 am		Questions/Discussion
11:45 am–1:45 pm		Lunch Break
1:45 pm–2:30 pm		Non-commutative Computation Avi Wigderson, Institute for Advanced Study, Princeton
2:30 pm–3:00 pm		Questions/Discussion/Break
3:00 pm–3:45 pm		Small Lifts of Expander Graphs are Expanding Alexandra Kolla, University of Illinois, Urbana-Champaign
3:45 pm–4:15 pm		Questions/Discussion/Break
4:15 pm–5:00 pm		Building Monotone Expanders Amir Yehudayoff, Technion Israel Institute of Technology
5:00 pm–5:15 pm		Questions/Discussion

Thursday, December 5th, 2013
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:15 am		The Structure of Low Rank Matrices Shachar Lovett, UC San Diego
10:15 am–10:45 am		Questions/Discussion/Break
10:45 am–11:30 am		Counting Sumsets and Applications Ben Green, University of Oxford
11:30 am–11:45 am		Questions/Discussion
11:45 am–1:45 pm		Lunch Break
1:45 pm–2:30 pm		Incidence Geometry and Applications to Theoretical Computer Science Shubhangi Saraf, Rutgers University
2:30 pm–3:00 pm		Questions/Discussion/Break
3:00 pm–3:45 pm		Laplacian Eigenvalues, Metric Uniformization, and Incidence Geometry James Lee, University of Washington
3:45 pm–4:15 pm		Questions/Discussion/Break
4:15 pm–5:00 pm		Hardness Amplification and the Approximate Degree of Constant-Depth Circuits Justin Thaler, Harvard University
5:00 pm–5:15 pm		Questions/Discussion

Friday, December 6th, 2013
9:00 am–9:30 am		Coffee and Check-In
9:30 am–10:15 am		Vertical Versus Horizontal Poincare Inequalities Assaf Naor, Courant Institute, NYU
10:15 am–10:45 am		Questions/Discussion/Break
10:45 am–11:30 am		Partial Difference Equations Over Compact Abelian Groups Tim Austin, Courant Institute, NYU
11:30 am–11:45 am		Questions/Discussion
11:45 am–1:45 pm		Lunch Break
1:45 pm–2:30 pm		Some Pseudorandom Phenomena in Finite Fields Swastik Kopparty, Rutgers University
2:30 pm–3:00 pm		Questions/Discussion/Break
3:00 pm–3:45 pm		Discrete Tori and Bounds for Linear Codes Alex Samorodnitsky, Hebrew University of Jerusalem
3:45 pm–4:15 pm		Questions/Discussion