Previous Conferences & Workshops

Nov
04
2020

Geometric and Modular Representation Theory Seminar

The Derived Geometric Satake Equivalence of Bezrukavnikov and Finkelberg
3:00pm|Simonyi Hall 101 and Remote Access

This is the last talk towards understanding Bezrukavnikov-Finkelberg's derived geometric Satake equivalence. With the preparations from previous talks, we will introduce two filtrations: a topological filtration on the equivariant cohomology and an...

Nov
04
2020

Stability and Testability

Stability and sofic approximations for product groups and property (tau)
Adrian Ioana
11:00am|Remote Access

A countable group $G$ is called sofic if it admits a sofic approximation: a sequence of asymptotically free almost actions on finite sets. Given a sofic group $G$, it is a natural problem to try to classify all its sofic approximations and, more...

Nov
03
2020

SL2 Seminar

Decomposition numbers in defining characteristic
4:00pm|Remote Access

The decomposition of the reduction of a Deligne--Lusztig character as a sum of Weyl modules is given by Jantzen's formula. In the case of $SL_2(F_q)$ the formula can be proved by a direct computation, and as a result we will see that the entries in...

Nov
02
2020

Analysis Seminar

Falconer distance set problem using Fourier analysis
4:30pm|Simonyi Hall 101 and Remote Access

Given a set $E$ of Hausdorff dimension $s > d/2$ in $\mathbb{R}^d$ , Falconer conjectured that its distance set $\Delta(E)=\{ |x-y|: x, y \in E\}$ should have positive Lebesgue measure. When $d$ is even, we show that $\dim_H E>d/2+1/4$ implies $|...

Nov
02
2020

Members’ Seminar

Metric embeddings, uniform rectifiability, and the Sparsest Cut problem
2:00pm|Simonyi Hall 101 and Remote Access

(joint work with Assaf Naor) A key problem in metric geometry asks: given metric spaces $X$ and $Y$, how well does $X$ embed in $Y$? In this talk, we will consider this problem for the case of the Heisenberg group and explain its connections to...

Nov
02
2020

Computer Science/Discrete Mathematics Seminar I

Anti-concentration and the Gap-Hamming problem
11:15am|Simonyi Hall 101 and Remote Access - see Zoom link below

We prove new lower bounds on the well known Gap-Hamming problem in communication complexity. Our main technical result is an anti-concentration bound for the inner product of two independent random vectors. We show that if A, B are arbitrary subsets...

Oct
30
2020

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

Three 20 min research talks
Simon Allais; Orsola Capovilla-Searle; Julian Chaidez
9:15am|Remote Access

Simon Allais (ENS Lyon)

Title: Generating functions in Hamiltonian dynamics and symplectic-contact rigidity

Abstract: Generating functions of Hamiltonian diffeomorphisms are maps that can be seen as finite dimensional versions of the action...

Oct
29
2020

Joint IAS/Princeton University Number Theory Seminar

An explicit supercuspidal local Langlands correspondence
4:30pm|Remote Access

We will give an explicit construction and description of a supercuspidal local Langlands correspondence for any $p$-adic group $G$ that splits over a tame extension, provided $p$ does not divide the order of the Weyl group. This construction matches...