An Analogue of the Ichino-Ikeda Conjecture for Whittaker Coefficients of the Metaplectic Group

Erez Lapid
Hebrew University of Jerusalem and Weizmann Institute of Science
March 14, 2013

A few years ago Ichino-Ikeda formulated a quantitative version of the Gross-Prasad conjecture, modeled after the classical work of Waldspurger. This is a powerful local-to-global principle which is very suitable for analytic and arithmetic applications. One can formulate a Whittaker analogue of the Ichino-Ikeda conjecture. We use the descent method of Ginzburg-Rallis-Soudry to reduce the Whittaker version to a purely local identity which we prove in the p-adic case under some mild hypotheses. Joint work with Zhengyu Mao

Resonance for Loop Homology on Spheres

Nancy Hingston
The College of New Jersey; Member, School of Mathemtics
March 15, 2013

Fix a metric (Riemannian or Finsler) on a compact manifold M. The critical points of the length function on the free loop space LM of M are the closed geodesics on M. Filtration by the length function gives a link between the geometry of closed geodesics, and the algebraic structure given by the Chas-Sullivan product on the homology of LM and the “dual” loop cohomology product.

Sensitivity Versus Block Sensitivity, II

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.

New Locally Decodable Codes from Lifting

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