Previous Conferences & Workshops

Apr
24
2012

Computer Science/Discrete Mathematics Seminar II

Pseudorandom Generators for Read-Once ACC^0
10:30am|S-101

We consider the problem of constructing pseudorandom generators for read-once circuits. We give an explicit construction of a pseudorandom generator for the class of read-once constant depth circuits with unbounded fan-in AND, OR, NOT and...

Apr
23
2012

Computer Science/Discrete Mathematics Seminar I

Computational Entropy
11:15am|S-101

Shannon's notion of entropy measures the amount of "randomness" in a process. However, to an algorithm with bounded resources, the amount of randomness can appear to be very different from the Shannon entropy. Indeed, various measures of...

Apr
19
2012

Joint IAS/Princeton University Number Theory Seminar

Multiple Zeta Values
4:30pm|S-101

I will report on some recent work on multiple zeta values. I will sketch the definition of motivic multiple zeta values, which can be viewed as a prototype of a Galois theory for certain transcendental numbers, and then explain how they were used to...

Apr
17
2012

Analysis Seminar

Sub-Weyl Subconvexity and Short p-Adic Exponential Sums
Djordje Milicevic
2:00pm|S-101

One of the principal questions about L-functions is the size of their critical values. In this talk, we will present a new subconvexity bound for the central value of a Dirichlet L-function of a character to a prime power modulus, which breaks a...

Apr
17
2012

Computer Science/Discrete Mathematics Seminar II

Nondeterministic Property Testing
10:30am|S-101

A property of finite graphs is called nondeterministically testable if it has a "certificate'' such that once the certificate is specified, its correctness can be verified by random local testing. In this talk we consider certificates that consist...

Apr
16
2012

Computer Science/Discrete Mathematics Seminar I

Near-Linear Time Approximation Algorithm for Balanced Separator
11:15am|S-101

The goal of the Balanced Separator problem is to find a balanced cut in a given graph G(V,E), while minimizing the number of edges that cross the cut. It is a fundamental problem with applications in clustering, image segmentation, community...

Apr
12
2012

Joint IAS/Princeton University Number Theory Seminar

Local Models of Shimura Varieties
Xinwen Zhu
4:30pm|Fine Hall -- 214

I will report some recent progress in the study of local models of Shimura varieties, including the proof of the coherence conjecture of Pappas-Rapoport and the Kottwitz conjecture