Previous Conferences & Workshops

Oct
13
2021

Mathematical Conversations

Tangent cones and their uniqueness, maybe a meeting ground for hard analysis and algebraic geometry
Camillo De Lellis
6:00pm|Birch Garden, Simons Hall

In several diverse settings (variational problems and geometric flows, elliptic, parabolic, but also some dispersive PDEs) monotonicity formulas allow to get a first coarse description of singularities, which are commonly called tangent cone. Their...

Oct
13
2021

Arithmetic Groups

First-order rigidity, bi-interpretability, and congruence subgroups
Nir Avni
11:00am|Remote Access
I'll describe a method for analyzing the first-order theory of an arithmetic group using its congruence quotients. When this method works, it gives a strong form of first-order rigidity together with a complete description of the collection of...
Oct
12
2021

Computer Science/Discrete Mathematics Seminar II

Recent progress in query complexity I & II
Pei Wu
10:30am|Simonyi Hall 101 and Remote Access

The query model is one of the most basic computational models.  In contrast to the Turing machine model, fundamental questions regarding the power of randomness and quantum computing are relatively well-understood.  For example, it is well-known...

Oct
11
2021

Joint IAS/Princeton University Symplectic Geometry Seminar

Tropical Lagrangian sections and Looijenga pairs
Andrew Hanlon
4:00pm|Fine Hall 314, Princeton University

We will discuss the first steps in an approach to proving homological mirror symmetry for Looijenga pairs through tropical Lagrangian sections. Namely, we will see how to construct these Lagrangian sections from tropical data corresponding to line...

Oct
11
2021

Members' Colloquium

What is the h-principle?
Camillo De Lellis
2:00pm|Simonyi Hall 101 and Remote Access

The honest answer to the question is that I actually do not know. I will therefore rather talk about several famous examples that are widely called "h-principle results" and try to explain some of the ideas behind the ones I am most familiar with.

Oct
11
2021

Computer Science/Discrete Mathematics Seminar I

The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
Alexandros Hollender
11:15am|Simonyi Hall 101 and Remote Access

We consider the problem of computing a Gradient Descent solution of a continuously differentiable function f on a bounded convex domain, i.e., finding a "point where Gradient Descent terminates". Equivalently, this corresponds to computing a so...

Oct
08
2021

Joint IAS/Princeton/Montreal/Paris/Tel-Aviv Symplectic Geometry Zoominar

Three 20 minute research talks
Jean-Philippe Chassé, Leo Digiosia and Rima Chatterjee
9:15am|Remote Access
Jean-Philippe Chassé (UdeM)

Title:Convergence and Riemannian bounds on Lagrangian submanifolds

Abstract: Recent years have seen the appearance of a plethora of possible metrics on spaces of Lagrangian submanifolds. Indeed, on top of the better...

Oct
07
2021

Joint IAS/Princeton University Number Theory Seminar

Bounds for standard L-functions
Paul Nelson
4:30pm|Simonyi 101 and Remote Access

We consider the standard L-function attached to a cuspidal automorphic representation of a general linear group. We present a proof of a subconvex bound in the t-aspect. More generally, we address the spectral aspect in the case of uniform parameter...