Overview reveals a counterexample to the rank additivity conjecture in tensor rank theory, indicating implications for computational complexity.
The rank additivity conjecture, first formulated by Volker Strassen in 1973, states that the rank of the direct sum of two independent tensors is equal to the sum of their individual ranks. In the last decades, this conjecture has been a central topic in tensor rank theory and its implications for computational complexity. In 2019, Yaroslav Shitov disproved this conjecture in its general form by showing the existence of a counter-example using a dimension counting argument. In this paper, we provide an overview of the Strassen problem and Shitov's work and revisit his counterexample with a detailed explanation, offering an alternative proof.
No takes yet. Share an insight, caveat, or question.
Borovik et al. (2025) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: