Strong Approximation on Random Towers of Graphs

SHORT TALKS BY POSTDOCTORAL MEMBERS
Topic:Strong Approximation on Random Towers of Graphs
Speaker:Yair Glasner
Affiliation:IAS
Date:Thursday, October 6
Time/Room:4:00pm - 5:00pm/S-101

I will explain, in elementary graph theoretic terms, the strong approximation phenomenon in linear groups as it was discovered by Weisfeiler and Nori. It turns out that the strong approximation phenomenon holds also for some random families of graphs. I will try to explain why I hope that this line of research might shed some new light on the connection between randomness, expansion and arithmetic in graph theory.