Previous Conferences & Workshops

Feb
03
2023

Special Year Informal Seminar

Convergence of Ergodic Averages Along the Sequence $\Omega(n)$
Kaitlyn Loyd
1:30pm|Simonyi 101

Following Birkhoff's proof of the Pointwise Ergodic Theorem, it has been studied whether convergence still holds along various subsequences. In 2020, Bergelson and Richter showed that under the additional assumption of unique ergodicity, pointwise...

Feb
03
2023

Probability Seminar

Nathanaël Berestycki
10:15am|Simonyi 101 and Remote Access

Lecture 1: 10:15-11:15

On The Cover Time of Random Walks on Graphs

How long does it take for a random walk to cover all the vertices of a graph? 

And what is the structure of the uncovered set (the set of points not yet visited by the walk) close...

Feb
02
2023

Joint IAS/PU Number Theory Seminar

Selmer Averages in Families of Elliptic Curves with Marked Points and Applications
3:00pm|Princeton University, Fine Hall 214

Orbits of many coregular representations of algebraic groups are closely linked to moduli spaces of genus one curves with extra data. We may use these orbit parametrizations to compute the average size of Selmer groups of elliptic curves in certain...

Feb
01
2023

Mathematical Conversations

One Curvy Metaphor in Systolic Geometry
6:00pm|Birch Garden, Simons Hall

Abstract: In 2010, Larry Guth wrote a beautiful essay "Metaphors in systolic geometry", where he poetically described several approaches to Gromov's celebrated systolic inequality. A nontrivial special case of this inequality claims that a...

Jan
31
2023

Special Year Research Seminar

Non-Rigidity of Horocycle Orbit Closures in Geometrically Infinite Surfaces
Or Landesberg
2:00pm|Simonyi 101 and Remote Access

Horospherical group actions on homogeneous spaces are famously known to be extremely rigid. In finite volume homogeneous spaces, it is a special case of Ratner’s theorems that all horospherical orbit closures are homogeneous. Rigidity further...

Jan
31
2023

Computer Science/Discrete Mathematics Seminar II

A Subpolynomial Approximation Algorithm for Graph Crossing Number in Low-Degree Graphs
Zihan Tan
10:30am|Simonyi Hall 101 and Remote Access

Graph Crossing Number is a fundamental and extensively studied problem with wide ranging applications. In this problem, the goal is to draw an input graph $G$ in the plane so as to minimize the number of crossings between the images of its edges...

Jan
30
2023

IAS/Princeton Arithmetic Geometry Seminar

Stable Homotopy without Homotopy
4:30pm|Simonyi Hall 101 and Remote Access

Many cohomology theories in algebraic geometry, such as crystalline and syntomic cohomology, are not homotopy invariant. This is a shame, because it means that the stable motivic homotopy theory of Morel--Voevodsky cannot be employed in studying the...

Jan
30
2023

Joint IAS/Princeton University Symplectic Geometry Seminar

Convex Bodies with all Planar Characteristics
Anastasiia Sharipova
4:00pm|Fine 314 and Remote Access

I will show that in symplectic space smooth strongly convex bodies with all characteristics planar or all outer billiard trajectories planar are affine symplectic images of a ball.

Jan
30
2023

Members' Colloquium

Closing Lemmas in Contact Dynamics and Holomorphic Curves
2:00pm|Simonyi Hall 101 and Remote Access - see Zoom link below

Given a flow on a manifold, how to perturb it in order to create a periodic orbit passing through a given region? While the first results in this direction were obtained in the 1960-ies, various facets of this question remain largely open. I will...