Explicit Euclidean Sections, Codes over the Reals and Expanders

Add to your list(s) Download to your calendar using vCal

• Wigderson, A (IAS Princeton)
• Tuesday 12 April 2011, 13:45-14:45
• Seminar Room 1, Newton Institute.

If you have a question about this talk, please contact Mustapha Amrani.

Discrete Analysis

Here is a basic problem, which comes under various names including “compressed sensing matrices”, Euclidean sections of L1”, “restricted isometries” and more. Find a subspace X or R^N such that every vector x in X has the same L1 and L2 norms (with proper normalization) up to constant factors. It is known that such subspaces of dimension N/2 exist (indeed “most” of them are), and the problem is to describe one explicitly. I will describe some progress towards this problem, based on extending the notion of expander codes from finite fields to the reals.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

• All CMS events
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• Seminar Room 1, Newton Institute
• bld31

Note that ex-directory lists are not shown.