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:Isaac Newton Institute Seminar Series
SUMMARY:Recent contributions of algebraic geometry and rep
resentation theory to complexity theory - Landsber
g\, JM (Texas A&\;M University)
DTSTART;TZID=Europe/London:20131017T090000
DTEND;TZID=Europe/London:20131017T100000
UID:TALK48238AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/48238
DESCRIPTION:Algebraic geometry and representation theory have
been used to prove lower bounds for the complexity
of matrix multiplication\, the complexity of line
ar circuits (matrix rigidity)\, and Geometric Comp
lexity Theory (questions related to the conjecture
that P is distinct from NP). Remarkably\, these q
uestions in computer science are related to classi
cal questions in algebraic geometry regarding obje
cts such as dual varieties\, secant varieties\, Da
rboux hypersurfaces\, and classical intersection t
heory\, as well as questions in representation the
ory such as the Foulkes-Howe conjecture and the as
ymptotic study of Kronecker coefficients. I will g
ive an overview of my joint work with G. Ottaviani
(matrix multiplication)\, L. Manivel and N. Ressa
yre (GCT) and F. Gesmundo\, J. Hauenstein\, and C.
Ikenmeyer (linear circuits).\n
LOCATION:Seminar Room 1\, Newton Institute
CONTACT:Mustapha Amrani
END:VEVENT
END:VCALENDAR