BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Information\, Graphs\, Optimization: the Lovász bound on the Shan
 non capacity - Oisín Faust\, Cambridge
DTSTART:20210421T130000Z
DTEND:20210421T140000Z
UID:TALK158164@talks.cam.ac.uk
CONTACT:Dominic Wynter
DESCRIPTION:How efficiently can one communicate over a noisy channel in a 
 reliable (zero error) way? This was asked\, and in many ways answered\, by
  Claude Shannon shortly after he invented information theory. The efficien
 cy value Shannon defined remains elusive today: it is a graph-theoretic pa
 rameter which we know how to compute only for very special channels. Fortu
 nately\, it has a very nice\, efficiently computable upper bound which is 
 due to László Lovász.\n\nI will give a brief introduction to these idea
 s\, which I believe many in the CMI community might find interesting. It i
 s my intention that a few elementary notions from graph theory and linear 
 algebra should be enough to follow this talk.
LOCATION:https://maths-cam-ac-uk.zoom.us/j/95531783868?pwd=U3pPbmYxTXZYRVZ
 MWFBVTkVnWmUvZz09
END:VEVENT
END:VCALENDAR