The talk will describe the use of expanders in (at least) two problems. The first is the construction of (near-) Euclidean sections of L1-spaces (related to compressed sensing and real-valued codes). The second is designing randomness-efficient local group-homomorphism testers. Both raise natural open questions.
Copyright. All Rights Reserved.