ARC Colloquium: Adam Marcus, and Yale University

Event Details
  • Date/Time:
    • Monday December 9, 2013 - Tuesday December 10, 2013
      2:00 pm - 1:59 pm
  • Location: Klaus 1116W
  • Phone:
  • URL:
  • Email:
  • Fee(s):
  • Extras:



Summary Sentence: No summary sentence submitted.

Full Summary: No summary paragraph submitted.

Speaker: Adam Marcus

Title: Interlacing Families and Bipartite Ramanujan Graphs

Abstract: We will outline the proof that shows the existence of bipartite Ramanujan Graphs of any degree as well as some of mixed degrees. Our approach uses the idea of Bilu and Linial to show that there exists a 2-lift of a given Ramanujan graph which maintains the Ramanujan property.  This will include introducing a new technique for establishing the existence of certain combinatorial objects that we call the "Method of Interlacing Polynomials."

This talk is intended to be accessible by a general computer science audience, and represents joint work with Dan Spielman and Nikhil Srivastava.

Additional Information

In Campus Calendar

College of Computing, School of Computer Science, ARC

Invited Audience
Undergraduate students, Faculty/Staff, Graduate students
No keywords were submitted.
  • Created By: Elizabeth Ndongi
  • Workflow Status: Published
  • Created On: Nov 14, 2013 - 5:30am
  • Last Updated: Apr 13, 2017 - 5:23pm