Previous Conferences & Workshops

Oct
29
2021

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

Detecting non-trivial elements in the spaces of Legendrian knots via Algebraic K-theory
9:15am|Remote Access

This talk is based on a joint work with Thomas Kragh. Using the generating function theory we split inject homotopy groups of pseudo-isotopy and/or h-cobordism spaces into various spaces of Legendrian manifolds, e.g. the space of Legendrian unknots...

Oct
28
2021

Joint IAS/Princeton University Number Theory Seminar

Reducible fibers and monodromy of polynomial maps
4:30pm|Simonyi Hall 101 and Remote Access

For a polynomial $f\in \mathbb Q[x]$, Hilbert's irreducibility theorem asserts that the fiber $f^{-1}(a)$ is irreducible over $\mathbb Q$ for all values $a\in \mathbb Q$ outside a "thin" set of exceptions $R_f$. The problem of describing $R_f$ is...

Oct
28
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
27
2021

Mathematical Conversations

Gaussian Elimination with Complete Pivoting: Searching for a Needle in a Haystack
6:00pm|Birch Garden, Simons Hall

Gaussian elimination is one of the oldest and most popular techniques for factoring a matrix. The growth of entries in Gaussian elimination is an important practical problem. Modern results as well as practice show that entry growth is not a...

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