Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Thursday, June 05, 2014, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Michelle Delcourt (University of Illinois at Urbana-Champaign)
Constructing large families of Ramanujan graphs, expander graphs which are "optimal" from a spectral point of view, has been an important problem with many applications in computer science and engineering. Known constructions are fairly simple but rely heavily on group theory and number theory. In this talk, we will briefly touch on results from a breakthrough paper by Marcus, Spielman, and Srivastava, which uses combinatorial methods, and use this work to construct large families of Ramanujan hypergraphs.
Automatic MiSe System Software Version 1.4803M | admin login