arXiv (OAI Expanded)
open access
New lower bounds on tensor rank of $(2,n,m)$ matrix multiplication with GPT-6
The tensor rank of $2\times n$-with-$n\times m$ matrix multiplication is at least $(n+2)m$ if $n\ge 4$ and at least $\left\lceil \frac{24}{5}m \right\rceil$ if $n=3$. Both lower bounds apply over arbitrary fields.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- New lower bounds on tensor rank of $(n,2,m)$ matrix multiplication with GPT-6#1128639
- Concise tensors with maximal symmetries#1123656
- Maximal rank of $4\times 4\times 4$ and $k\times 4\times 3$ tensors over $\mathbb{F}_2$#972699
- A lower bound for $\langle 3,2,m \rangle$ matrix multiplication#1036464
- Lower Bound of 22 for 3x3 Matrix Multiplication over the Integers#1156910
Record · ID 1083833
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive