BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:CMI Student Seminar Series
SUMMARY:Information\, Graphs\, Optimization: the Lovász bo
und on the Shannon capacity - Oisín Faust\, Cambri
dge
DTSTART;TZID=Europe/London:20210421T140000
DTEND;TZID=Europe/London:20210421T150000
UID:TALK158164AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/158164
DESCRIPTION:How efficiently can one communicate over a noisy c
hannel in a reliable (zero error) way? This was as
ked\, and in many ways answered\, by Claude Shanno
n shortly after he invented information theory. Th
e efficiency value Shannon defined remains elusive
today: it is a graph-theoretic parameter which we
know how to compute only for very special channel
s. Fortunately\, 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 i
deas\, which I believe many in the CMI community m
ight find interesting. It is my intention that a f
ew 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=
U3pPbmYxTXZYRVZMWFBVTkVnWmUvZz09
CONTACT:Dominic Wynter
END:VEVENT
END:VCALENDAR