Kronecker powers of tensors and Strassen’s laser method

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

Documents

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

We answer a question, posed implicitly in [18, §11], [11, Rem. 15.44] and explicitly in [9, Problem 9.8], showing the border rank of the Kronecker square of the little Coppersmith-Winograd tensor is the square of the border rank of the tensor for all q > 2, a negative result for complexity theory. We further show that when q > 4, the analogous result holds for the Kronecker cube. In the positive direction, we enlarge the list of explicit tensors potentially useful for the laser method. We observe that a well-known tensor, the 3×3 determinant polynomial regarded as a tensor, det3 ∈ C9 C9 C9, could potentially be used in the laser method to prove the exponent of matrix multiplication is two. Because of this, we prove new upper bounds on its Waring rank and rank (both 18), border rank and Waring border rank (both 17), which, in addition to being promising for the laser method, are of interest in their own right. We discuss “skew” cousins of the little Coppersmith-Winograd tensor and indicate why they may be useful 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

Original languageEnglish
Title of host publication11th Innovations in Theoretical Computer Science Conference, ITCS 2020
EditorsThomas Vidick
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Publication date2020
Article number10
ISBN (Electronic)9783959771344
DOIs
Publication statusPublished - 2020
Event11th Innovations in Theoretical Computer Science Conference, ITCS 2020 - Seattle, United States
Duration: 12 Jan 202014 Jan 2020

Conference

Conference11th Innovations in Theoretical Computer Science Conference, ITCS 2020
LandUnited States
BySeattle
Periode12/01/202014/01/2020
SeriesLeibniz International Proceedings in Informatics, LIPIcs
Volume151
ISSN1868-8969

    Research areas

  • Asymptotic rank, Laser method, Matrix multiplication complexity, Tensor rank

Number of downloads are based on statistics from Google Scholar and www.ku.dk


No data available

ID: 256725524