Previous Conferences & Workshops

Mar
28
2016

Computer Science/Discrete Mathematics Seminar I

A local central limit theorem for triangles in a random graph
11:15am|West Building Lecture Hall

What is the distribution of the number of triangles in the random graph $G(n, 1/2)$? It was known for a long time that this distribution obeys a central limit theorem: from the point of view of large intervals (~ standard-deviation length), the...

Mar
25
2016

Mathematical Conversations

Conversations on Schubert's Wandererfantasie
6:00pm|Dilworth Room

Schubert's Wandererfantasie is one of the most monumental and revolutionary piano pieces ever composed. I will highlight some of the structural novelties that were adapted later by Liszt, Wagner, Franck and others, and I will play the piece.

Mar
24
2016

Joint IAS/Princeton University Number Theory Seminar

Low-lying, fundamental, reciprocal geodesics
4:30pm|S-101

Markoff numbers give rise to extremely low-lying reciprocal geodesics on the modular surface, but it is unknown whether infinitely many of these are fundamental, that is, the corresponding binary quadratic form has fundamental discriminant. In joint...

Mar
23
2016

Analysis Seminar

Universality for random matrices beyond mean field models
4:30pm|S-101

The goal of this talk is to explain universality for random band matrices, for band width comparable to the matrix size. Patching of quantum unique ergodicity on successive blocks plays a key role in proving random matrix statistics for such non...

Mar
22
2016

Geometric Structures on 3-manifolds

Slowly converging pseudo-Anosovs
Mark Bell
2:00pm|S-101

A classical property of pseudo-Anosov mapping classes is that they act on the space of projective measured laminations with north-south dynamics. This means that under iteration of such a mapping class, laminations converge exponentially quickly...

Mar
22
2016

Computer Science/Discrete Mathematics Seminar II

The Resolution proof system
10:30am|S-101

The Resolution proof system is perhaps the simplest and most universally used in verification system and automated theorem proving. It was introduced by Davis and Putnam in 1960. The study of its efficiency, both in terms of proof length of natural...

Mar
21
2016

Joint IAS/Princeton University Symplectic Geometry Seminar

Stable homotopy theory and Floer theory
Thomas Kragh
3:10pm|S-101

In this talk I will define and explain some basic notions from stable homotopy theory, and illustrate how it relates to (and refines) the notion of Floer homology in some simple cases. I will also discuss what extra kind of information this...