Rank and border rank of Kronecker powers of tensors and Strassen's laser method

Publikation: Bidrag til tidsskriftTidsskriftartikelForskningfagfællebedømt

Dokumenter

  • Fulltext

    Forlagets udgivne version, 608 KB, PDF-dokument

  • Austin Conner
  • Fulvio Gesmundo
  • Joseph M. Landsberg
  • Emanuele Ventura

We prove that the border rank of the Kronecker square of the little Coppersmith–Winograd tensor Tcw,q is the square of its border rank for q> 2 and that the border rank of its Kronecker cube is the cube of its border rank for q> 4. This answers questions raised implicitly by Coppersmith & Winograd (1990, §11)and explicitly by Bläser (2013, Problem 9.8) and rules out the possibility of proving new upper bounds on the exponent of matrix multiplication using the square or cube of a little Coppersmith–Winograd tensor in this range. In the positive direction, we enlarge the list of explicit tensors potentially useful for Strassen's laser method, introducing a skew-symmetric version of the Coppersmith–Winograd tensor, Tskewcw,q. For q= 2 , the Kronecker square of this tensor coincides with the 3 × 3 determinant polynomial, det 3∈ C9⊗ C9⊗ C9, regarded as a tensor. We show that this tensor could potentially be used to show that the exponent of matrix multiplication is two. We determine new upper bounds for the (Waring) rank and the (Waring) border rank of det 3, exhibiting a strict submultiplicative behaviour for Tskewcw,2 which is promising for the laser method. We establish general results regarding border ranks of Kronecker powers of tensors, and make a detailed study of Kronecker squares of tensors in C3⊗ C3⊗ C3.

OriginalsprogEngelsk
Artikelnummer1
TidsskriftComputational Complexity
Vol/bind31
Udgave nummer1
Sider (fra-til)1-40
ISSN1016-3328
DOI
StatusUdgivet - jun. 2022

Bibliografisk note

Funding Information:
Landsberg supported by NSF grant AF-1814254. Gesmundo acknowledges support from VILLUM FONDEN via the QMATH Centre of Excellence (Grant no. 10059). We thank the anonymous referees for their careful reading of the paper and useful suggestions.

Publisher Copyright:
© 2021, The Author(s).

ID: 343168440