Discrete Analysis: Beyond the Boolean Cube: March 9 – 15, 2014

Date & Time


Location


About Autism Research

Autism Research lectures are open to the public and are held at the Gerald D. Fischbach Auditorium at the Simons Foundation headquarters in New York City. Tea is served prior to each lecture.

View all Lectures in This Series

March 9 – 15, 2014

Organizers:
Elchanan Mossel, UC Berkeley
Ryan O’Donnell, Carnegie Mellon University
Krzysztof Oleszkiewicz, University of Warsaw

The Simons Symposium on Discrete Analysis: Beyond the Boolean Cube was the second symposium organized on this topic. The first was held in 2012 and was called Analysis of Boolean Functions. This most recent meeting focused on the interplay between the discrete cube setting and its non-commutative, non-independent, continuous, and number-theoretic counterparts. Key topics included Fourier analysis on groups, discrete analysis in additive groups and fields, invariance principles, discrete partitions of Gaussian and spherical spaces, Gaussian isoperimetric problems, connections between boundedness of Gaussian and Rademacher processes, explicit optimal rounding of semidefinite programs, and connections to Markov chains.

Materials:

Presentation Slides

 
Boaz Barak,
Microsoft Research
Some questions, results, and musings on Sums of Squares, Unique Games Conjecture, Hypercontractive norms, Sparse vectors, and other issues.

Witold Bednorz,
University of Warsaw
(joint work with Rafal Latala)
Beyond Bernoulli Theorem

Subhash Khot,
New York University
(Joint work with Madhur Tulsiani and Pratik Worah)
A Characterization of Strong Approximation Resistance

Alexandra Kolla,
University of Illinois Urbana-Champaign
Maximal Inequalities Beyond the Boolean Cube

Raghu Meka,
Microsoft Research
A PTAS for Computing the Supremum of Gaussian Processes

Yuval Peres,
Microsoft Research
(Joint work with Yael Dekel at The Hebrew University and Ori Gurel-Gurevich at University of British Columbia)
Finding Hidden Cliques in Linear Time with High Probability

Li-Yang Tan,
Columbia University
(Joint work with Rocco Servedio)
A Polynomial Lower Bound for Monotonicity Testing of Boolean Functions

Symposium Agenda

Download PDF

Discrete Analysis: Beyond the Boolean Cube
March 9 – 15, 2014

 
Site: http://analysisofbooleanfunctions.org

Participants:

Boaz Barak, Microsoft Research New England
Witold Bednorz, University of Warsaw
Sergey Bobkov, University of Minnesota
Almut Burchard, University of Toronto
Yuval Filmus, University of Toronto
Ehud Friedgut, The Einstein Institute of Mathematics
Christophe Garban, ENS Lyon, UMPA
Subhash Khot, New York University
Alexandra Kolla, University of Illinois at Urbana-Champaign
Rafal Latala, University of Warsaw
Raghu Meka, IAS
Elchanan Mossel, UC Berkeley
Joe Neeman, UC Berkeley
Ryan O’Donnell, Carnegie Mellon University
Krzysztof Oleszkiewicz, University of Warsaw
Yuval Peres, Microsoft Research
Oded Regev, New York University
Tom Sanders, Oxford University
Stanislaw Szarek, Case Western Reserve University
Li-Yang Tan, Columbia University
Yuri Tschinkel, Simons Foundation
Thomas Vidick, MIT
Avi Wigderson, IAS
Julia Wolf, École Polytechnique

Subscribe to MPS announcements and other foundation updates