Irreversibility of Structure Tensors of Modules

10/04/2021
by   Maciej Wojtala, et al.
0

Determining the matrix multiplication exponent ω is one of the greatest open problems in theoretical computer science. We show that it is impossible to prove ω = 2 by starting with structure tensors of modules of fixed degree and using arbitrary restrictions. It implies that the same is impossible by starting with 1_A-generic non-diagonal tensors of fixed size with minimal border rank. This generalizes the work of Bläser and Lysikov [3]. Our methods come from both commutative algebra and complexity theory.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/21/2020

Geometric rank of tensors and subrank of matrix multiplication

Motivated by problems in algebraic complexity theory (e.g., matrix multi...
research
05/11/2022

Concise tensors of minimal border rank

We determine defining equations for the set of concise tensors of minima...
research
03/23/2021

Bounds on complexity of matrix multiplication away from CW tensors

We present three families of minimal border rank tensors: they come from...
research
09/23/2020

Bad and good news for Strassen's laser method: Border rank of the 3x3 permanent and strict submultiplicativity

We determine the border ranks of tensors that could potentially advance ...
research
05/30/2022

Subrank and Optimal Reduction of Scalar Multiplications to Generic Tensors

Since the seminal works of Strassen and Valiant it has been a central th...
research
12/17/2016

Fast Matrix Multiplication and Symbolic Computation

The complexity of matrix multiplication (hereafter MM) has been intensiv...
research
04/08/2023

No-Existence Of Generalize Diffusion

We show that given two arbitrary states |ψ⟩,|ϕ⟩ it is impossible to comp...

Please sign up or login with your details

Forgot password? Click here to reset