Previous Conferences & Workshops

Dec
04
2006

Computer Science/Discrete Mathematics Seminar I

Transparent Achievement of Correlated Equilibrium
Silvio Micali
11:15am|S-101

Achieving correlated equilibrium is a problem at the intersection of game theory, cryptography and efficient algorithms. Thus far, however, perfectly rational solutions have been lacking, and the problem has been formulated with somewhat limited...

Nov
30
2006

Joint IAS/Princeton University Number Theory Seminar

Sieve Methods for Quantum Unique Ergodicity and General Shifted Sums
4:30pm|Princeton University, Fine Hall 214

In this talk, I shall introduce a sieve method for bounding the average size of shifted convolution summation terms related to the Quantum Unique Ergodicity Conjecture for a fixed Hecke-Maass cusp form. This bound will be uniform in the spectral...

Nov
29
2006

Complex Algebraic Geometry

Singularities and Spaces of Jets
1:00pm|S-101

I will give an introduction to spaces of jets of algebraic varieties, explining their relevance for birational geometry. In particular, I will explain why these spaces are useful in the study of singularities.

Nov
28
2006

Computer Science/Discrete Mathematics Seminar II

New Correlation Bounds for GF(2) Polynomials Using the Gowers Norm
10:30am|S-101

In this work we study the correlation between low-degree GF(2) polynomials and explicit functions, where the correlation between two functions f,p : {0,1}^n -> {+1,-1} is defined as Correlation(p,f) := | E_x [f(x) p(x)] | = | P_x[f(x) = p(x)] - P_x...

Nov
27
2006

Computer Science/Discrete Mathematics Seminar I

New Locally Decodable Codes and Private Information Retrieval Schemes
11:15am|S-101

A q-query Locally Decodable Code (LDC) encodes an n-bit message x as an N-bit codeword C(x), such that one can probabilistically recover any bit x_i of the message by querying only q bits of the codeword C(x), even after some constant fraction of...