Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

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)

Infinite Families of Ramanujan Hypergraphs

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.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login