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.2105.events_uoft_date.0@www.mathematics.utoronto.ca
CREATED:20221012T163456Z
DESCRIPTION:\nWhen and Where: \nThursday, November 10, 2022 12:35 pm \n R
oom 1170 \n Bahen Centre for Information Technology \n 40 Saint George St.
, Toronto, M5S 2E4 \n\nSpeakers \nMark Braverman \n\nDescription: \nWe w
ould 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 Braverma
n earned his doctorate from the University of Toronto in 2008. Currently h
e is a Professor of Princeton University. His awards include a SFCM Stephe
n Smale Prize in 2014, a European Mathematical Society Prize in 2016, an
d the Abacus Medal (former Nevanlinna Prize) of the International Mathemat
ical Union in 2022.Series Title: Communication, Information, and Geometr
yAbstract:Communication complexity is an area of computational complexity
theory that studies the amount of communication required to complete a com
putational task. Communication complexity gives us some of the most succes
sful techniques for proving impossibility results for computational tasks.
Information complexity connects communication complexity with Shannon’s cl
assical information theory. It treats information revealed or transmitted
as the resource to be conserved. On the one hand, information complexity
leads to extensions of classical information and coding theory to interact
ive scenarios. On the other hand, it provides us with tools to answer ope
n questions about communication complexity and related areas.In the first
lecture, we will give a high-level overview of communication and informat
ion complexity. In the second lecture, we will talk about the question of
minimizing surface area of tiles, which dates back to the 19th century,
but turns out to have surprising connections to computational complexity
and information theory. In the third lecture, we will circle back to appl
ications of information complexity to problems in computational complexity
.First Lecture: Wednesday, November 9 from 4:00-5:00pm in BA 1160Second L
ecture: Thursday, November 10 from 4:00-5:00pm in BA 1170 Third Lecture:
Friday, November 11 from 4:00-5:00pm in BA 6183The Wednesday lecture will
be for a general audience, the Thursday lecture will be for a general ma
th audience, and the Friday lecture will be for specialists.Looking forwa
rd to seeing you there. \n40 Saint George St., Toronto, M5S 2E4 \n\nCate
gories \n SeminarsLecturesDepartment EventColloquia \n\nAudiences \n Alumn
i and FriendsProspective UndergraduatesUndergraduate StudentsStaffProspect
ive Graduate StudentsAudiencePostdoctoral FellowsGraduating StudentsGradua
te StudentsGeneral AudienceFirst-Year StudentsFacultyEmeritusCommunity
DTSTART;TZID=America/Toronto:20221110T123500
DTEND;TZID=America/Toronto:20221110T123500
LAST-MODIFIED:20221012T163546Z
LOCATION:40 Saint George St., Toronto, M5S 2E4
SUMMARY:Blyth Lectures (Nov 10)
URL;TYPE=URI:https://www.mathematics.utoronto.ca/events/blyth-lectures-nov-
10
END:VEVENT
END:VCALENDAR