# Colloquia: Difference between revisions

No edit summary |
No edit summary |
||

Line 11: | Line 11: | ||

(Hosted by Gurevitch) | (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, [https://impa.br/en_US/page-pessoas/carolina-araujo/ Carolina Araujo] (IMPA) == | == October 9, 2020, [https://impa.br/en_US/page-pessoas/carolina-araujo/ Carolina Araujo] (IMPA) == |

## Revision as of 16:15, 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)