Previous Conferences & Workshops

Oct
01
2007

Computer Science/Discrete Mathematics Seminar I

The Pattern Matrix Method for Lower Bounds on Quantum Communication
Alexander Sherstov
11:15am|S-101

In a breakthrough result, Razborov (2003) gave optimal lower bounds on the communication complexity of every function f of the form f(x,y)=D(|x AND y|) for some D:{0,1,...,n}->{0,1}, in the bounded-error quantum model with and without prior...

Sep
27
2007

Joint IAS/Princeton University Number Theory Seminar

Hilbert Modular Generating Series with Coefficients in Intersection Homology
J. Getz
4:30pm|Fine Hall 214, Princeton University

In a seminal Inventiones 1976 paper, Hirzebruch and Zagier produced a set of cycles on certain Hilbert modular surfaces whose intersection numbers are the Fourier coefficients of elliptic modular forms with nebentypus. Their result can be viewed as...