Hosted by Dailymotion. For legal issues report at the Copyright Center, report us on DMC, or use the Instant Removal tool.
If the player does not load, watch on Dailymotion directly.
[METRIC 2011] Emmanuel Breuillard
34 Views • Apr 01, 2011
Description
Workshop on Expanders and derandomization (March 21-25, 2011)
Mar 23, 13:30-14:30 - Emmanuel Breuillard (U. Paris-Sud, Orsay)
Random pairs of elements in finite simple groups of bounded rank generate expanders
---
In joint work with B. Green, B. Guralnick and T.Tao, we prove that almost all pairs of elements in a finite simple group of bounded rank give rise to a Cayley graph with a uniform spectral gap. The method follows the strategy put forward a few years ago by Bourgain and Gamburd (who proved it for PSL(2,Z/pZ)) and makes use of the recent results (Pyber-Szabo, Breuillard-Green-Tao) on the classification of approximate subgroups of finite simple groups of Lie type. A key step in the proof is to show the existence of free subgroups of semisimple algebraic groups that are "strongly dense". This means that every non abelian subgroup of it is Zariski dense.
More from User
[2017 MPRI 2.11.1] Molecular programming 3/4 (8 NOV)
Nicolas Schabanel
[2017 MPRI 2.11.1] Molecular programming 4/4 (15 NOV)
Nicolas Schabanel
[2017 MPRI 2.11.1] Molecular programming 2/4 (25 OCT)
Nicolas Schabanel
[2017 MPRI 2.11.1] Molecular programming 1:4 (18 OCT)
Nicolas Schabanel
[2016 MPRI 2.11.1] 7. Nature Programming: Intrisic Universality & Other models including Oritatami (2016/11/9)
Nicolas Schabanel
[2016 MPRI 2.11.1] 6. Nature Programming: Universality in Tile Assembly Systems (2016/11/2)
Nicolas Schabanel
Related Videos
[Metric 2011] Johan Hastad
Nicolas Schabanel
[METRIC 2011] Oded Goldreich
Nicolas Schabanel
[Metric 2011] Ran Raz
Nicolas Schabanel
[Metric 2011] Assaf Naor
Nicolas Schabanel
[Metric 2011] Moses Charikar
Nicolas Schabanel
[metric 2011] Venkatesan Guruswami
Nicolas Schabanel