Previous Conferences & Workshops

Mar
06
2012

Computer Science/Discrete Mathematics Seminar II

Applications of FT-Mollification
10:30am|S-101

In FT-mollification, one smooths a function while maintaining good quantitative control on high-order derivatives. I will describe this approach and show how it can be used to show that bounded independence fools polynomial threshold functions over...

Mar
05
2012

Members’ Seminar

Local Correction of Codes and Euclidean Incidence Geometry
2:00pm|S-101

A classical theorem in Euclidean geometry asserts that if a set of points has the property that every line through two of them contains a third point, then they must all be on the same line. We prove several approximate versions of this theorem (and...

Mar
05
2012

Computer Science/Discrete Mathematics Seminar I

The Complexity of Distributions
11:15am|S-101

Complexity theory, with some notable exceptions, typically studies the complexity of computing a function h(x) of a *given* input x. We advocate the study of the complexity of generating -- or sampling -- the output distribution h(x) for random x...

Mar
01
2012

Joint IAS/Princeton University Number Theory Seminar

The Tamagawa Number Formula via Chiral Homology
4:30pm|S-101

Let X a curve over F_q and G a semi-simple simply-connected group. The initial observation is that the conjecture of Weil's which says that the volume of the adelic quotient of G with respect to the Tamagawa measure equals 1, is equivalent to the...