## The James Construction and $pi_4(S^3)$

Guillaume Brunerie

School of Mathematics, IAS

March 27, 2013

Guillaume Brunerie

School of Mathematics, IAS

March 27, 2013

Institute for Advanced Study

March 27, 2013

Jean-Michel Bismut

Universite de Paris-Sud

March 26, 2013

Madhu Sudan

Microsoft Research

March 25, 2013

Locally decodable codes (LDCs) are error-correcting codes that allow for highly-efficient recovery of "pieces" of information even after arbitrary corruption of a codeword. Locally testable codes (LTCs) are those that allow for highly-efficient testing to see if some given word is close to a codeword. Codes derived from evaluations of low-degree multivariate polynomials give the simplest

Noam Zeilberger

IMDEA Software Institute; Member, School of Mathematics

March 22, 2013

Andrej Bauer

University of Ljubljana, Slovenia; Member, School of Mathematics

March 21, 2013

Michael Shulman

University of California, San Diego; Member, School of Mathematics

March 20, 2013

Hao Huang

University of California, Los Angeles; Member, School of Mathematics

March 19, 2013

There are two important measures of the complexity of a boolean function: the sensitivity and block sensitivity. Whether or not they are polynomial related remains a major open question. In this talk I will survey some known results on this conjecture, and its connection with various combinatorial problems.

Eli Ben-Sasson

Technion; Massachusetts Institute of Technology

March 18, 2013

Egbert Rijke

School of Mathematics, IAS

March 14, 2013