Remarks on the complexity of finding tensor ranks
Mohsen Aliabadi (UCSD)
Monday, May 19th 2025, 2-3pm
Abstract:
The purpose of this talk is to present a linear algebra-based algorithm for determining whether the rank of a given tensor over a field $\mathbb{F}$ is at most $k$ over the algebraic closure $\overline{\mathbb{F}}$, where $k$ is a given positive integer. We also estimate the arithmetic complexity of the algorithm.