General asymptotic rank speedup theorems are established via Strassen calculus, proving the asymptotic rank of cw_2 is below 3.931 and yielding an upper bound below d^{2ω/3} for any d×d×d tensor.
Symmetric powers: structure, smoothability, and applications
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Copositive matrices with nondecreasing off-diagonal entries admit a PSD plus nonnegative decomposition, which implies exactness of a natural relaxation for separable quadratic optimization over the simplex.
citing papers explorer
-
Asymptotic Rank Speedup Theorems, Revisited
General asymptotic rank speedup theorems are established via Strassen calculus, proving the asymptotic rank of cw_2 is below 3.931 and yielding an upper bound below d^{2ω/3} for any d×d×d tensor.
-
Copositive Matrices with Ordered Off-Diagonal Entries
Copositive matrices with nondecreasing off-diagonal entries admit a PSD plus nonnegative decomposition, which implies exactness of a natural relaxation for separable quadratic optimization over the simplex.