Previous Conferences & Workshops

Jan
22
2013

Analysis Seminar

Sphere Packing Bounds Via Spherical Codes
Henry Cohn
4:30pm|S-101

We develop a simple geometric variant of the Kabatiansky-Levenshtein approach to proving sphere packing density bounds. This variant gives a small improvement to the best bounds known in Euclidean space (from 1978) and an exponential improvement in...

Jan
22
2013

Analysis Seminar

Hamiltonian Evolution Equations -- Where They Come From, What They Are Good For
Juerg Froehlich
3:15pm|S-101

Several examples of Hamiltonian evolution equations for systems with infinitely many degrees of freedom are presented. It is sketched how these equations can be derived from some underlying quantum dynamics ("mean-field limit") and what kind of...

Jan
22
2013

Computer Science/Discrete Mathematics Seminar II

Sparsity Lower Bounds for Dimensionality Reducing Maps
10:30am|S-101

Abstract: We give near-tight lower bounds for the sparsity required in several dimensionality reducing linear maps. In particular, we show: (1) The sparsity achieved by [Kane-Nelson, SODA 2012] in the sparse Johnson-Lindenstrauss lemma is optimal up...

Jan
21
2013

Computer Science/Discrete Mathematics Seminar I

Clique Number of Random Geometric Graphs in High Dimension
Sebastien Bubeck
11:15am|S-101

In small dimension a random geometric graph behaves very differently from a standard Erdös-Rényi random graph. On the other hand, when the dimension tends to infinity (with the number of vertices being fixed) both models coincide. In this talk we...