# Mittagsseminar (in cooperation with J. Lengler, A. Steger, and D. Steurer)

__Mittagsseminar Talk Information__ | |

**Date and Time**: Thursday, January 20, 2005, 12:15 pm

**Duration**: This information is not available in the database

**Location**: This information is not available in the database

**Speaker**: Raphael Meyer

## Cooperative Facility Location Games

In order to find new lower bounds in bilinear complexity, e.g., for the matrix multiplication, we want to combine former ideas due to Strassen with the new approach Mulmuley and Sohoni suggested in 2001. Since the multiplication map of a given associative algebra (e.g., a matrix algebra) induces a bilinear map, finding lower bounds for the complexity of an algebra means finding lower bounds for the rank of the tensor induced by the multiplication map of this algebra.

Strassen proved that a tensor has border rank *r* if and only if it lies in the projective *SL*_{r}*SL_{r}*SL_{r}-orbit closure of the unit tensor of rank *r*. Hence, the crucial problem for finding new lower bounds is to show that such a tensor does not lie in a specific orbit closure, which means that this problem is reduced to the orbit closure problem analyzed in Mumfords book on Geometric Invariant Theory.

Mulmuely and Sohoni suggested to prove this by constructing explicit representation theoretic obstructions, that is, irreducible modules whose multiplicities in the coordinate ring of the orbit closure of a tensor *t* exceeds that of the orbit closure of the unit tensor. This is a wild problem in the general case but seems to behave better in some special cases, i.e., if the tensors are stable resp. partially stable.

On the other hand, one is also (more generally) interested in the question whether a given tensor lies in the orbit closure of another tensor or not. Another approach to solve this is to use the stability of certain tensors and prove incomparability of such tensors by using Luna's étale slice theorem. Roughly spoken, it says that the orbit of a stable from locally "looks" like a fibre bundle.

We will give a short introduction to both methods and name some results we were able to show by using the latter one.

Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)

Previous talks by year: 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M | admin login