Previous Conferences & Workshops

Mar
08
2011

Computer Science/Discrete Mathematics Seminar II

Relativized Separations of Worst-Case and Average-Case Complexities for NP
10:30am|S-101

Non-relativization of complexity issues can be interpreted as giving evidence that these issues cannot be resolved by “black-box” techniques. We show that the assumption $DistNP \subseteq AvgP$ does not imply that $NP\subseteq BPP$ by relativizing...

Mar
07
2011

Members’ Seminar

Self-Avoiding Walk and Branched Polymers
2:00pm|S-101

I will introduce two basic problems in random geometry. A self-avoiding walk is a sequence of steps in a d-dimensional lattice with no self-intersections. If branching is allowed, it is called a branched polymer. Using supersymmetry, one can map...

Mar
07
2011

Computer Science/Discrete Mathematics Seminar I

A Randomized Rounding Approach for Symmetric TSP
Mohit Singh
11:15am|S-101

We show a (3/2-\epsilon)-approximation algorithm for the graphical traveling salesman problem where the goal is to find a shortest tour in an unweighted graph G. This is a special case of the metric traveling salesman problem when the underlying...

Mar
03
2011

Joint IAS/Princeton University Number Theory Seminar

Periods of Quaternionic Shimura Varieties
4:30pm|S-101

In the early 80's, Shimura made a precise conjecture relating Petersson inner products of arithmetic automorphic forms on quaternion algebras over totally real fields, up to algebraic factors. This conjecture (which is a consequence of the Tate...

Mar
03
2011

Galois Representations and Automorphic Forms Seminar

Statistics for Families of Automorphic Representations
Sug-Woo Shin
2:15pm|S-101

Let G be a connected reductive group over Q such that G(R) has discrete series representations. I will report on some statistical results on the Satake parameters (w.r.t. Sato-Tate distributions) and low-lying zeros of L-functions for families of...