Previous Conferences & Workshops

Mar
18
2013

Members’ Seminar

Five Stages of Accepting Constructive Mathematics
2:00pm|S-101

Discussions about constructive mathematics are usually derailed by philosophical opinions and meta-mathematics. But how does it actually feel to do constructive mathematics? A famous mathematician wrote that "taking the principle of excluded middle...

Mar
18
2013

Computer Science/Discrete Mathematics Seminar I

Constant Rate PCPs for Circuit-SAT with Sublinear Query Complexity
11:15am|S-101

The PCP theorem (Arora et. al., J. ACM 45(1,3)) says that every NP-proof can be encoded to another proof, namely, a probabilistically checkable proof (PCP), which can be tested by a verifier that queries only a small part of the PCP. A natural...

Mar
15
2013

Joint IAS/Princeton University Symplectic Geometry Seminar

Resonance for Loop Homology on Spheres
1:30pm|S-101

Fix a metric (Riemannian or Finsler) on a compact manifold M. The critical points of the length function on the free loop space LM of M are the closed geodesics on M. Filtration by the length function gives a link between the geometry of closed...

Mar
14
2013

Joint IAS/Princeton University Number Theory Seminar

An Analogue of the Ichino-Ikeda Conjecture for Whittaker Coefficients of the Metaplectic Group
Erez Lapid
4:30pm|S-101

A few years ago Ichino-Ikeda formulated a quantitative version of the Gross-Prasad conjecture, modeled after the classical work of Waldspurger. This is a powerful local-to-global principle which is very suitable for analytic and arithmetic...

Mar
14
2013

Marston Morse Lectures

The Codimension Barrier in Incidence Geometry
2:00pm|S-101

Incidence geometry is a part of combinatorics that studies the intersection patterns of geometric objects. For example, suppose that we have a set of L lines in the plane. A point is called r-rich if it lies in r different lines from the set. For a...