Previous Conferences & Workshops

Mar
10
2011

Joint IAS/Princeton University Number Theory Seminar

Affine Sieve and Expanders
Alireza Golsefity
4:30pm|Fine Hall -- 214

I will talk about the fundamental theorem of affine sieve (joint with Sarnak). The main black box in the proof of this result will be also explained. It is a theorem on a necessary and sufficient condition for a finitely generated subgroup of SL(n,Q...

Mar
10
2011

Galois Representations and Automorphic Forms Seminar

Analytic Geometry Over F_1
2:15pm|S-101

I'll talk on work in progress on algebraic and analytic geometry over the field of one element F_1. This work originates in non-Archimedean analytic geometry as a result of a search for appropriate framework for so called skeletons of analytic...

Mar
09
2011

Galois Representations and Automorphic Forms Seminar

Galois Representations Associated to Holomorphic Limits of Discrete Series
2:15pm|S-101

We attach Galois representations to automorphic representations on unitary groups whose weight (=component at infinity) is a holomorphic limit of discrete series. The main innovation is a new construction of congruences, using the Hasse Invariant...

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...