Orateur
Derek Wu
(Texas A&M University)
Description
One measure of the complexity of a tensor is its border rank.
Finding the border rank of a tensor, or even bounding it, is a difficult problem that is currently an area of active research, as several problems in theoretical computer science come down to determining the border ranks of certain tensors.
For a class of
I discuss a special case where these tensors correspond to spaces of matrices of constant rank.