ALADDIN
CENTER Carnegie Mellon UniversityCarnegie Mellon Computer Science DepartmentSchool of Computer Science
Abstracts
The Joint ALADDIN/Theory/Operations Research Seminar
Aladdin
About
Calendar
People
PROBEs
Workshops
Papers
Education
Related Activities
Corporate
Contact
 
Captcha
Outreach Roadshow

Expander graphs - where Combinatorics and Albegra compete and cooperate.
Avi Wigderson, IAS Princeton and The Hebrew university

Abstract:

Expansion of graphs can be given equivalent definitions in combinatorial and algebraic terms. This is the most basic connection between combinatorics and algebra illuminated by expanders and the quest to construct them. The talk will survey how fertile this connection has been to both fields, focusing on recent results. In particular, we'll explain the zig-zag product of graphs, how it leads to an elementary combinatorial construction of expanders, and its relation to semi-direct product in groups.

Host: Manuel Blum

This material is based upon work supported by National Science Foundation under Grant No. 0122581.
Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not necessarily reflect the views of the
National Science Foundation