Previous Conferences & Workshops

Mar
27
2018

Joint IAS/Princeton University Number Theory Seminar

Summation formulae and speculations on period integrals attached to triples of automorphic representations
4:45pm|Simonyi Hall 101

Braverman and Kazhdan have conjectured the existence of summation formulae that are essentially equivalent to the analytic continuation and functional equation of Langlands L-functions in great generality. Motivated by their conjectures and related...

Mar
27
2018

Locally Symmetric Spaces Seminar

Analytic aspects of Arthur's trace formula
Tobias Finis
1:45pm|Simonyi Hall 101

We will present an introduction to Arthur's trace formula from an analytic point of view. After recalling Arthur's regularization procedure, we will review the absolute convergence and continuity of the trace formula for a large natural class of...

Mar
27
2018

Computer Science/Discrete Mathematics Seminar II

Heisenberg geometry and the Goemans—Linial SDP
10:30am|Simonyi Hall 101

Algorithmic graph partitioning tasks are naturally related to geometric issues. Over the past decades, several deeper connections of this type have emerged. In this talk, we will describe one example by showing that, up to lower order factors, the...

Mar
26
2018

Joint IAS/Princeton University Symplectic Geometry Seminar

Open Quantum Kirwan Map
Guangbo Xu
4:00pm|Simonyi Hall 101

(Joint work with Chris Woodward) Consider a Lagrangian submanifold $\bar L$ in a GIT quotient $\bar X = X//G$. Besides the usual Fukaya $A_\infty$ algebra $Fuk(\bar L)$ defined by counting holomorphic disks, another version, called the quasimap...

Mar
26
2018

Members’ Seminar

Kazhdan-Lusztig theory for matroids
2:00pm|Simonyi Hall 101

There is a remarkable parallel between the theory of Coxeter groups (think of the symmetric group Sn or the dihedral group Dn) and matroids (think of your favorite graph or vector configuration). After giving an overview of the similarity, I will...

Mar
26
2018

Computer Science/Discrete Mathematics Seminar I

Circuit Lower Bounds for Nondeterministic Quasi-Polytime: An Easy Witness Lemma for NP and NQP
Cody Murray
11:00am|Simonyi Hall 101

We prove that if every problem in NP has n^k-size circuits for a fixed constant k, then for every NP-verifier and every yes-instance x of length n for that verifier, the verifier's search space has a witness for x that can be encoded with a circuit...

Mar
21
2018

Analysis Seminar

Vertical perimeter versus horizontal perimeter
1:30pm|Simonyi Hall 101

We will show that the appropriately-defined vertical perimeter of a measurable subset of the Heisenberg group is at most a constant multiple of its horizontal (Heisenberg) perimeter. This isoperimetric-type inequality exhibits different behavior in...