The symmetric rank conjecture for the skew matrix multiplication polynomial of size three
Let denote the skew matrix multiplication polynomial of size , and let denote its symmetric rank, namely the least number of cubes of linear forms whose sum equals the polynomial. Numerical computations give a decomposition with summands. Symmetric rank conjecture.
The preceding lower and upper bounds are , so the conjecture asserts that the numerically found decomposition is optimal. The decomposition was found numerically using Bertini, with all summands having rank ; an exact proof of the equality is not supplied here.
References
- Luca Chiantini, Jonathan D. Hauenstein, Christian Ikenmeyer, J. M. Landsberg and Giorgio Ottaviani, “Polynomials and the exponent of matrix multiplication”, arXiv:1706.05074 (2017).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.