Irreversibility of Structure Tensors of Modules
Maciej Wojtala

TL;DR
This paper proves that certain algebraic approaches cannot resolve the matrix multiplication exponent , highlighting fundamental limitations in current methods from algebra and complexity theory.
Contribution
It establishes the irreversibility of using structure tensors of modules to prove , extending previous results and combining techniques from algebra and complexity theory.
Findings
Proves impossibility of proving =2 using structure tensors of modules
Shows limitations of starting with -generic non-diagonal tensors
Generalizes previous work by Ble4ser and Lysikov
Abstract
Determining the matrix multiplication exponent is one of the greatest open problems in theoretical computer science. We show that it is impossible to prove by starting with structure tensors of modules of fixed degree and using arbitrary restrictions. It implies that the same is impossible by starting with -generic non-diagonal tensors of fixed size with minimal border rank. This generalizes the work of Bl\"aser and Lysikov [3]. Our methods come from both commutative algebra and complexity theory.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Computability, Logic, AI Algorithms · Coding theory and cryptography
