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.2101.events_uoft_date.0@www.mathematics.utoronto.ca
CREATED:20221012T162904Z
DESCRIPTION:\nWhen and Where: \nFriday, November 11, 2022 4:00 pm to 5:00
pm \n Room 6183 \n Bahen Centre for Information Technology \n 40 Saint Ge
orge St., Toronto, M5S 2E4 \n\nSpeakers \nMark Braverman \n\nDescription
: \nWe would like to invite all members of the Math community to the 25th
A\nual R. A. Blyth Lectures in Mathematics from November 9-11, 2022.Mark
Braverman earned his doctorate from the University of Toronto in 2008. Cur
rently he is a Professor of Princeton University. His awards include a SFC
M Stephen Smale Prize in 2014, a European Mathematical Society Prize in 2
016, and the Abacus Medal (former Nevanlinna Prize) of the International
Mathematical Union in 2022.Series Title: Communication, Information, and
GeometryAbstract:Communication complexity is an area of computational com
plexity theory that studies the amount of communication required to comple
te a computational task. Communication complexity gives us some of the mos
t successful techniques for proving impossibility results for computationa
l tasks.Information complexity connects communication complexity with Shan
non’s classical information theory. It treats information revealed or tran
smitted as the resource to be conserved. On the one hand, information com
plexity leads to extensions of classical information and coding theory to
interactive scenarios. On the other hand, it provides us with tools to an
swer open questions about communication complexity and related areas.In th
e first lecture, we will give a high-level overview of communication and
information complexity. In the second lecture, we will talk about the que
stion of minimizing surface area of tiles, which dates back to the 19th c
entury, but turns out to have surprising connections to computational com
plexity and information theory. In the third lecture, we will circle back
to applications of information complexity to problems in computational co
mplexity.First Lecture: Wednesday, November 9 from 4:00-5:00pm in BA 1160
Second Lecture: Thursday, November 10 from 4:00-5:00pm in BA 1170 Third L
ecture: Friday, November 11 from 4:00-5:00pm in BA 6183The Wednesday lect
ure will be for a general audience, the Thursday lecture will be for a ge
neral math audience, and the Friday lecture will be for specialists.Looki
ng forward to seeing you there. \n40 Saint George St., Toronto, M5S 2E4
\n\nCategories \n SeminarsLecturesDepartment EventColloquia \n\nAudiences
\n Alumni and FriendsProspective UndergraduatesUndergraduate StudentsStaff
Prospective Graduate StudentsAudiencePostdoctoral FellowsGraduating Studen
tsGraduate StudentsGeneral AudienceFirst-Year StudentsFacultyEmeritusCommu
nity
DTSTART;TZID=America/Toronto:20221111T160000
DTEND;TZID=America/Toronto:20221111T170000
LAST-MODIFIED:20221012T163625Z
LOCATION:40 Saint George St., Toronto, M5S 2E4
SUMMARY:Blyth Lecture Series (Nov 11)
URL;TYPE=URI:https://www.mathematics.utoronto.ca/events/blyth-lecture-serie
s-nov-11
END:VEVENT
END:VCALENDAR