Previous Conferences & Workshops

Oct
26
2021

Special Seminar

Existence of an unbounded nodal hypersurface for smooth Gaussian fields in dimension d > 2
Hugo Duminil-Copin
4:00pm|Simonyi Hall 101 and Remote Access

For the Bargmann--Fock field on $R^d$ with $d > 2$, we prove that the critical level $l_c(d)$ of the percolation model formed by the excursion sets $\{ f \ge l \}$ is strictly positive. This implies that for every l sufficiently close to 0 (in...

Oct
26
2021

Computer Science/Discrete Mathematics Seminar II

Locally testable codes with constant rate, distance, and locality, Part II
Irit Dveer Dinur
10:30am|Simonyi Hall 101 and Remote Access

A locally testable code (LTC) is an error correcting code that admits a very efficient membership test. The tester reads a constant number of (randomly - but not necessarily uniformly - chosen) bits from a given word and rejects words with...

Oct
25
2021

Joint IAS/Princeton University Symplectic Geometry Seminar

Mirror symmetry from the SYZ base
Benjamin Gammage
4:00pm|Fine Hall 314, Princeton University

The Gross-Siebert program suggests that mirror symmetry is mediated by the combinatorial data of a dual pair of integral affine manifolds with singularities and polyhedral decomposition. Much is now understood about the passage from the...

Oct
25
2021

Members' Colloquium

A (slightly less) brief look into the restricted 3-body problem
Agustin Moreno
2:00pm|Simonyi Hall 101 and Remote Access

Despite the fact that the 3-body problem is an ancient conundrum that goes back to Newton, it is remarkably poorly understood, and is still a benchmark for modern developments. In this talk, I will give a (very) biased account of this classical...

Oct
25
2021

Computer Science/Discrete Mathematics Seminar I

Locally testable codes with constant rate, distance, and locality, Part I
Irit Dveer Dinur
11:15am|Simonyi Hall 101 and Remote Access

A locally testable code (LTC) is an error correcting code that admits a very efficient membership test. The tester reads a constant number of (randomly - but not necessarily uniformly - chosen) bits from a given word and rejects words with...

Oct
22
2021

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

Big fiber theorems and ideal-valued measures in symplectic topology
Yaniv Ganor
9:15am|Remote Access

In various areas of mathematics there exist "big fiber theorems", these are theorems of the following type: "For any map in a certain class, there exists a 'big' fiber", where the class of maps and the notion of size changes from case to case.

We...

Oct
21
2021

Discussions in Analysis and Geometry

Reading seminar on papers of Honda-Huang and Breem-Christopher, exploring the notion of convexity in high dimensional contact geometry
2:00pm|Simonyi Hall 101 and Remote Access
Oct
20
2021

Mathematical Conversations

The Unreasonable Effectiveness of Convexity in Symplectic Geometry
Shira Tanny
6:00pm|Birch Garden, Simons Hall

Convexity plays a central role in several geometric and dynamical problems in symplectic geometry. However, convexity is not preserved under structure preserving isomorphisms and it is unknown whether there exists an intrinsic property responsible...