research
∙
06/02/2023
Discreteness of asymptotic tensor ranks
Tensor parameters that are amortized or regularized over large tensor po...
share
research
∙
12/28/2022
Partial Degeneration of Tensors
Tensors are often studied by introducing preorders such as restriction a...
research
∙
12/03/2022
A Gap in the Subrank of Tensors
The subrank of tensors is a measure of how much a tensor can be ”diagona...
research
∙
10/06/2022
Fault-tolerant Coding for Entanglement-Assisted Communication
Channel capacities quantify the optimal rates of sending information rel...
research
∙
11/16/2021
Larger Corner-Free Sets from Combinatorial Degenerations
There is a large and important collection of Ramsey-type combinatorial p...
research
∙
04/13/2021
Position-based cryptography: Single-qubit protocol secure against multi-qubit attacks
While it is known that unconditionally secure position-based cryptograph...
research
∙
04/02/2021
Communication Complexity, Corner-Free Sets and the Symmetric Subrank of Tensors
We develop and apply new combinatorial and algebraic tools to understand...
research
∙
12/28/2020
Weighted Slice Rank and a Minimax Correspondence to Strassen's Spectra
Structural and computational understanding of tensors is the driving for...
research
∙
09/15/2020
Fault-tolerant Coding for Quantum Communication
Designing encoding and decoding circuits to reliably send messages over ...
research
∙
07/10/2020
Border rank non-additivity for higher order tensors
Whereas matrix rank is additive under direct sum, in 1981 Schönhage show...
research
∙
03/06/2020
Barriers for rectangular matrix multiplication
We study the algorithmic problem of multiplying large matrices that are ...
research
∙
12/17/2018
Barriers for fast matrix multiplication from irreversibility
The determination of the asymptotic algebraic complexity of matrix multi...
research
∙
09/22/2017