Pseudorandomness in Mathematics and Computer Science Mini-Workshop
Friday, April 22, 2011
School of Mathematics
Institute for Advanced Study
All sessions took place in Simonyi Hall lecture room 101.
In math, one often studies random aspects of deterministic systems and structures. In CS, one often tries to efficiently create structures and systems with specific random-like properties. Recent work has shown many connections between these two approaches through the concept of "pseudorandomness". This workshop highlights these connections, aimed at a joint audience of mathematicians and computer scientists.
10:15-11:15 p.m. Peter Varju, Princeton University
“Random Walks in Linear Groups”
11:30 a.m.-12:30 p.m. Swastik Kopparty, Institute for Advanced Study
“The Correlation of Multiplicative Characters with Polynomials over Finite Fields”
12:30-2:30 p.m. Lunch (available in the IAS Dining Hall)*
2:30-3:30 p.m. Larry Guth, University of Toronto and Institute for Advanced Study
“The polynomial method and applications from finite field Kakeya to distinct distances”
3:30 p.m. Coffee/tea and cookies break, Fuld Hall
4:00-5:00 p.m. Zeev Dvir, Princeton University
“Monotone expanders - constructions and applications”
5:00-6:00 p.m. Alex Kontorovich, Stony Brook University
“On Zaremba’s Conjecture”
Videos of all lectures are available at video.ias.edu/pseudo-mini.