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 M. Ghaffari, A. Steger and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, January 13, 2005, 12:15 pm

Duration: This information is not available in the database

Location: This information is not available in the database

Speaker: Mathias Schacht (HU Berlin)

Discrepancy and Eigenvalues of Cayley Graphs

We consider quasirandom properties for Cayley graphs of finite abelian groups. We show that having uniform edge-distribution (i.e., small discrepancy) and having large eigenvalue gap are equivalent properties for such Cayley graphs, even if they are sparse. This positively answers a question of Chung and Graham ["Sparse quasi-random graphs'', Combinatorica 22 (2002), no. 2, pp. 217-244] for the particular case of abelian Cayley graphs, while in general the answer is negative.

(This is joint work with Yoshiharu Kohayakawa (Universidade de São Paulo) and Vojtěch Rödl (Emory University).)

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

Previous talks by year:   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