Previous Conferences & Workshops

Jan
30
2012

Computer Science/Discrete Mathematics Seminar I

Nearly Optimal Deterministic Algorithms Via M-Ellipsoids
Santosh Vempala
11:15am|S-101

Milman's ellipsoids play an important role in modern convex geometry. Here we show that their proofs of existence can be turned into efficient algorithms, and these in turn lead to improved deterministic algorithms for volume estimation of convex...

Jan
25
2012

Symplectic Dynamics Seminar

Symplectic Structures and Dynamics on Vortex Membranes
4:00pm|S-101

We present a Hamiltonian framework for higher-dimensional vortex filaments (or membranes) and vortex sheets as singular 2-forms with support of codimensions 2 and 1, respectively, i.e. singular elements of the dual to the Lie algebra of divergence...

Jan
25
2012

Symplectic Dynamics Seminar

On Conjugacy of Convex Billiards
2:00pm|S-101

There are indications that in the 80s Guillemin posed a question: If billiard maps are conjugate, can we say that domains are the same up to isometry? On one side, we show that conjugacy of different domains can't be C^1 near the boundary. In...

Jan
24
2012

Computer Science/Discrete Mathematics Seminar II

A Tutorial on the Likely Worst-Case Complexities of NP-Complete Problems
10:30am|S-101

The P vs. NP problem has sometimes been unofficially paraphrased as asking whether it is possible to improve on exhaustive search for such problems as Satisfiability, Clique, Graph Coloring, etc. However, known algorithms for each of these problems...

Jan
23
2012

Members’ Seminar

The Role of Symmetry in Phase Transitions
Tom Spencer
2:00pm|S-101

This talk will review some theorems and conjectures about phase transitions of interacting spin systems in statistical mechanics. A phase transition may be thought of as a change in a typical spin configuration from ordered state at low temperature...

Jan
23
2012

Computer Science/Discrete Mathematics Seminar I

An Optimal Lower Bound for File Maintenance
11:15am|S-101

In the file maintenance problem, n integer items from the set {1,....,r} are to be stored in an array of size m>=n . The items are presented sequentially in an arbitrary order and must be stored in the array in sorted order (but not necessarily in...

Jan
19
2012

Joint IAS/Princeton University Number Theory Seminar

Poisson Statistics and the Value Distribution of the Epstein Zeta Function
Anders Sodergren
4:30pm|S-101

We will discuss the value distribution of the Epstein zeta function E_n(L,cn) for real c and a random lattice L of covolume 1 and large dimension n. Important ingredients in our study will be the distribution of vector lengths in a random lattice as...