BEGIN:VCALENDAR
PRODID:-//Mercury//HGEvent//EN
VERSION:2.0
METHOD:PUBLISH
BEGIN:VEVENT
STATUS:CONFIRMED
LAST-MODIFIED:20141024T061505
PRIORITY:0
CLASS:PUBLIC
UID:ATEvent-eed436ece7e23bbcfe0d4623c4969225
SUMMARY:ARC Colloquium: Adam Marcus\, Crisply.com and Yale University
DESCRIPTION:Speaker: Adam Marcus\nTitle: Interlacing Families and Bipartite Ramanujan Graphs\nAbstract: 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."\nThis talk is intended to be accessible by a general computer science audience\, and represents joint work with Dan Spielman and Nikhil Srivastava.\n
DTSTART:20131209T150000
DTEND:20131209T150000
CREATED:20131114T181506
DTSTAMP:20131114T181506
SEQUENCE:0
LOCATION:
END:VEVENT
END:VCALENDAR