## Weak Stability Boundary and Capture in the Three-Body Problem

GEOMETRY/DYNAMICAL SYSTEMS

Edward Belbruno

NASA/AISR & IOD, Inc.

January 19, 2011

GEOMETRY/DYNAMICAL SYSTEMS

Ankur Moitra

Massachusetts Institute of Technology

January 18, 2011

Sergei Vassilvitskii

Yahoo! Research

January 17, 2011

Fred Cohen

University of Rochester; Member, School of Mathematics

January 10, 2011

Topological spaces given by either (1) complements of coordinate planes in Euclidean space or (2) spaces of non-overlapping hard-disks in a fixed disk have several features in common. The main results, in joint work with many people, give decompositions for the so-called "stable structure" of these spaces as well as consequences of these decompositions.

This talk will present definitions as well as basic properties.

David Huse

Princeton University; Member, School of Mathematics

December 17, 2010

**ANALYSIS/MATHEMATICAL PHYSICS SEMINAR**

Andrei Jorza

Institute for Advanced Study

December 16, 2010

To a regular algebraic cuspidal representation of GL(2) over a quadratic imaginary field, whose central character is conjugation invariant, Taylor et al. associated a two dimensional Galois representation which is unramified at l different from p outside a finite set of places. The first half of this talk concerns the crystallinity of the Galois representation at p , under a technical assumption. The second half of the talk is on recent work towards local-global compatibility (on GSp(4) and its implication for GL(2)).

Larry Guth

University of Toronto; Member, School of Mathematics

December 14, 2010

Erdos conjectured that N points in the plane determine at least c N (log N)^{-1/2} different distances. Building on work of Elekes-Sharir, Nets Katz and I showed that the number of distances is at least c N (log N)^{-1} . (Previous estimates had lower bounds like N^{.86}.)

Paul Seymour

Princeton University

December 13, 2010

A ``tournament'' is a digraph obtained from a complete graph by directing its edges, and ``colouring'' a tournament means partitioning its vertex set into acyclic subsets (``acyclic'' means the subdigraph induced on the subset has no directed cycles). This concept is quite like that for graph-colouring, but different. For instance, there are some tournaments H such that every tournament not containing H as a subdigraph has bounded chromatic number. We call them ``heroes''; for example, all tournaments with at most four vertices are heroes.

Vladimir Voevodsky

Institute for Advanced Study

December 10, 2010

The correspondence between homotopy types and higher categorical analogs of groupoids which was first conjectured by Alexander Grothendieck naturally leads to a view of mathematics where sets are used to parametrize collections of objects without "internal structure" while collections of objects with "internal structure" are parametrized by more general homotopy types. Univalent Foundations are based on the combination of this view with the discovery that it is possible to directly formalize reasoning about homotopy types using Martin-Lof type theories.

Mira Shamis

Institute for Advanced Study

December 10, 2010

Deift--Simon and Poltoratskii--Remling proved upper bounds on the measure of the absolutely continuous spectrum of Jacobi matrices. Using methods of classical approximation theory, we give a new proof of their results, and generalize them in several ways. First, we prove a sharper inequality taking the distribution of the values of the potential into account. Second, we prove a generalization of a "local" inequality of Deift--Simon to the non-ergodic setting. Based on joint work with Sasha Sodin