Previous Conferences & Workshops

Mar
17
2021

Stability and Testability

Approximate representations of symplectomorphisms via quantization
Leonid Polterovich
11:00am|Remote Access
We argue that quantization, a mathematical model of the quantum classical correspondence, gives rise to approximate unitary representations of symplectomorphism groups. As an application, we get an obstruction to symplectic action of Lubotzky...
Mar
16
2021

SL2 Seminar

Microlocal sheaves II: morphisms, microperverse sheaves and regular singularities
Michael McBreen
6:00pm|Remote Access

We introduce basic tools of the trade: the Fourier-Sato transform, specialisation, Sato's microlocalisation and the microhom functor, culminating with a concrete description of the morphisms in our category of microlocal sheaves. We use quantized...

Mar
16
2021

Computer Science/Discrete Mathematics Seminar II

Polynomial systems and mixed volumes
10:30am|Simonyi Hall 101 and Remote Access - see Zoom link below

Bernstein's theorem (also known as the Bernstein-Khovanskii-Kushnirenko theorem) gives a bound on the number of nonzero solutions of a polynomial system of equations in terms of the mixed volume of its Newton polytopes. In this talk, we will give...

Mar
15
2021

Analysis Seminar

The dissipation properties of transport noise
Franco Flandoli
4:30pm|Remote Access

In 2017 Lucio Galeati understood that a suitable scaling limit of certain hyperbolic PDEs with noise may lead to deterministic parabolic equations. Since then, in collaboration with Lucio and Dejun Luo, we have understood the phenomenon from several...

Mar
15
2021

Members’ Seminar

Estimating the mean of a real valued distribution
2:00pm|Simonyi Hall 101 and Remote Access

I revisit the basic statistical problem of estimating the mean of a real-valued distribution. I will introduce an estimator with the guarantee that "our estimator, on *any* distribution, is as accurate as the sample mean is for the Gaussian...

Mar
15
2021

Computer Science/Discrete Mathematics Seminar I

Local Proofs with Arbitrarily Small Encoding Overhead
11:15am|Remote Access - see Zoom link below

The celebrated PCP theorem from the 90's shows that any mathematical proof can be encoded in such a way that its correctness can be verified locally by reading only a tiny number of bits from the encoding. This foundational result has had a...

Mar
12
2021

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

Inverting primes in Weinstein geometry
Oleg Lazarev
9:15am|Remote Access

A classical construction in topology associates to a space $X$ and prime $p$, a new "localized" space $X_p$ whose homotopy and homology groups are obtained from those of $X$ by inverting $p$. In this talk, I will discuss a symplectic analog of this...