# Difference between revisions of "Colloquia"

(→September 25, 2020, Joseph Landsberg (Texas A&M)) |
(→December 4, 2020, TBA) |
||

Line 41: | Line 41: | ||

== November 20, 2020, TBA == | == November 20, 2020, TBA == | ||

− | == December 4, 2020, | + | == December 4, 2020, [http://math.sfsu.edu/federico/ Federico Ardila] (San Francisco) == |

− | |||

− | |||

− | |||

− | |||

== Past Colloquia == | == Past Colloquia == |

## Revision as of 15:23, 18 September 2020

**UW Madison mathematics Colloquium is ONLINE on Fridays at 4:00 pm. **

# Fall 2020

## September 25, 2020, Joseph Landsberg (Texas A&M)

(Hosted by Gurevitch)

**From theoretic computer science to algebraic geometry: how the complexity of matrix multiplication led me to the Hilbert scheme of points.**

In 1968 Strassen discovered the way we multiply nxn matrices (row/column) is not the most efficient algorithm possible. Subsequent work has led to the astounding conjecture that as the size n of the matrices grows, it becomes almost as easy to multiply matrices as it is to add them. I will give a history of this problem and explain why it is natural to study it using algebraic geometry and representation theory. I will conclude by discussing recent exciting developments that explain the second phrase in the title.

## October 9, 2020, Carolina Araujo (IMPA)

(Hosted by Ellenberg)

## October 23, 2020, Jeremy Quastel (University of Toronto)

(Hosted by Gorin)

## November 6, 2020, Yiannis Sakellaridis (Johns Hopkins University)

(Hosted by Gurevitch)