BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//prima-2022//speaker calendar//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZOME
TZID:America/Vancouver
TZURL:http://tzurl.org/zoneinfo-outlook/America/Vancouver
X-LIC-LOCATION:America/Vancouver
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP;TZID=America/Vancouver:20221206T163000
DTSTART;TZID=America/Vancouver:20221206T163000
DTEND;TZID=America/Vancouver:20221206T171500

UID:20221206T163000@prima2022.primamath.org
SUMMARY: From the Representation Theory of the Symmetric Group to Computational Complexity and back
DESCRIPTION:The irreducible representations of the  Symmetric group are a classical subject, seemingly well understood. Yet, the multiplicities in the irreducible decomposition of the tensor product of two irreducibles, the Kronecker coefficients, present an 80+ long standing open problem.  The problem has seen its revival in the context of Geometric Complexity Theory for the separation of complexity classes, the algebraic analogues of P vs NP. 

In this talk we will review some recent results on the asymptotics and complexity of Kronecker coefficients and the underlying characters of the Symmetric group. Based on a series of joint works with Christian Ikenmeyer and Igor Pak. 
STATUS:CONFIRMED
LOCATION:Junior Ballroom D
END:VEVENT
END:VCALENDAR