BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/Toronto
BEGIN:STANDARD
DTSTART:20221106T020000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20230312T020000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.2103.events_uoft_date.0@www.mathematics.utoronto.ca
CREATED:20221012T163400Z
DESCRIPTION:\nWhen and Where: \nWednesday, November 09, 2022 4:00 pm to 5
:00 pm \n Room 1160 \n Bahen Centre for Information Technology \n 40 Saint
George St., Toronto, M5S 2E4 \n\nSpeakers \nMark Braverman \n\nDescript
ion: \nWe would like to invite all members of the Math community to the 25
th A\nual R. A. Blyth Lectures in Mathematics from November 9-11, 2022.Ma
rk Braverman earned his doctorate from the University of Toronto in 2008.
Currently he is a Professor of Princeton University. His awards include a
SFCM Stephen Smale Prize in 2014, a European Mathematical Society Prize i
n 2016, and the Abacus Medal (former Nevanlinna Prize) of the Internation
al Mathematical Union in 2022.Series Title: Communication, Information,
and GeometryAbstract:Communication complexity is an area of computational
complexity theory that studies the amount of communication required to com
plete a computational task. Communication complexity gives us some of the
most successful techniques for proving impossibility results for computati
onal tasks.Information complexity connects communication complexity with S
hannon’s classical information theory. It treats information revealed or t
ransmitted as the resource to be conserved. On the one hand, information
complexity leads to extensions of classical information and coding theory
to interactive scenarios. On the other hand, it provides us with tools to
answer open questions about communication complexity and related areas.In
the first lecture, we will give a high-level overview of communication a
nd information complexity. In the second lecture, we will talk about the
question of minimizing surface area of tiles, which dates back to the 19t
h century, but turns out to have surprising connections to computational
complexity and information theory. In the third lecture, we will circle b
ack to applications of information complexity to problems in computational
complexity.First Lecture: Wednesday, November 9 from 4:00-5:00pm in BA 1
160Second Lecture: Thursday, November 10 from 4:00-5:00pm in BA 1170 Thir
d Lecture: Friday, November 11 from 4:00-5:00pm in BA 6183The Wednesday l
ecture will be for a general audience, the Thursday lecture will be for a
general math audience, and the Friday lecture will be for specialists.Lo
oking forward to seeing you there. \n40 Saint George St., Toronto, M5S 2
E4 \n\nCategories \n SeminarsLecturesDepartment EventColloquia \n\nAudienc
es \n Alumni and FriendsProspective UndergraduatesUndergraduate StudentsSt
affProspective Graduate StudentsAudiencePostdoctoral FellowsGraduating Stu
dentsGraduate StudentsGeneral AudienceFirst-Year StudentsFacultyEmeritusCo
mmunity
DTSTART;TZID=America/Toronto:20221109T160000
DTEND;TZID=America/Toronto:20221109T170000
LAST-MODIFIED:20221012T163522Z
LOCATION:40 Saint George St., Toronto, M5S 2E4
SUMMARY:Blyth Lecture Series (Nov 9)
URL;TYPE=URI:https://www.mathematics.utoronto.ca/events/blyth-lecture-serie
s-nov-9
END:VEVENT
END:VCALENDAR