63 citations · 185 across the 32 of their papers we have counts for
4 papers · 1 filter
Weighted slice rank and a minimax correspondence to Strassen's spectra
Matthias Christandl, Vladimir Lysikov, Jeroen Zuiddam
Structural and computational understanding of tensors is the driving force behind faster matrix multiplication algorithms, the unraveling of quantum entanglement, and the breakthro…
Border rank non-additivity for higher order tensors
Matthias Christandl, Fulvio Gesmundo, Mateusz Michałek +1
Whereas matrix rank is additive under direct sum, in 1981 Schönhage showed that one of its generalizations to the tensor setting, tensor border rank, can be strictly subadditive fo…
Barriers for rectangular matrix multiplication
Matthias Christandl, François Le Gall, Vladimir Lysikov +1
We study the algorithmic problem of multiplying large matrices that are rectangular. We prove that the method that has been used to construct the fastest algorithms for rectangular…
Geometric rank of tensors and subrank of matrix multiplication
Swastik Kopparty, Guy Moshkovitz, Jeroen Zuiddam
Motivated by problems in algebraic complexity theory (e.g., matrix multiplication) and extremal combinatorics (e.g., the cap set problem and the sunflower problem), we introduce th…