Recent works of Costa-Dalai, Christandl-Gesmundo-Zuiddam,
Blatter-Draism...
Tensor parameters that are amortized or regularized over large tensor po...
The subrank of tensors is a measure of how much a tensor can be
”diagona...
Since the seminal works of Strassen and Valiant it has been a central th...
There is a large and important collection of Ramsey-type combinatorial
p...
We develop and apply new combinatorial and algebraic tools to understand...
Structural and computational understanding of tensors is the driving for...
Whereas matrix rank is additive under direct sum, in 1981 Schönhage show...
We study the algorithmic problem of multiplying large matrices that are
...
Motivated by problems in algebraic complexity theory (e.g., matrix
multi...
We compute the asymptotic induced matching number of the k-partite
k-uni...
The determination of the asymptotic algebraic complexity of matrix
multi...
We study several quantum versions of the Shannon capacity of graphs and
...
We introduce the asymptotic spectrum of graphs and apply the theory of
a...
The asymptotic restriction problem for tensors is to decide, given tenso...