Abstract
We prove that the border rank of the Kronecker square of the little Coppersmith–Winograd tensor \(T_{cw,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, \(T_{skewcw,q}\). For \(q = 2\), the Kronecker square of this tensor coincides with the \(3\times 3\) determinant polynomial, \(\det_{3} \in \mathbb{C}^{9} \otimes \mathbb{C}^{9} \otimes \mathbb{C}^{9}\), 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 \(T_{skewcw,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 \(\mathbb{C}^{3} \otimes \mathbb{C}^{3} \otimes \mathbb{C}^{3}\).
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
J. Alman (2019). Limits on the Universal Method for Matrix Multiplication. In 34th Comp. Compl. Conf. (CCC 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
J. Alman & V. V. Williams (2018a). Further Limitations of the Known Approaches for Matrix Multiplication. In 9th Innov. Th. Comp. Science Conf., ITCS 2018, January 11–14, 2018, Cambridge, MA, USA, 25:1–25:15.
J. Alman & V. V. Williams (2018b). Limits on all known (and some unknown) approaches to matrix multiplication. In 2018 IEEE 59th Ann. Symp. Found. Comp. Sc. (FOCS), 580–591.
J. Alman & V. V. Williams (2021). A refined laser method and faster matrix multiplication. In Proc. 2021 ACM-SIAM Symp. Disc. Alg. (SODA), 522–539. SIAM.
A. Ambainis, Y. Filmus & F. Le Gall (2015). Fast matrix multiplication: limitations of the Coppersmith–Winograd method. In Proc. of the 47th ACM Symp. Th. Comp., 585–593. ACM.
E. Ballico, A. Bernardi, M. Christandl & F. Gesmundo (2019). On the partially symmetric rank of tensor products of W-states and other symmetric tensors. Atti Accad. Naz. Lincei Rend. Lincei Mat. Appl. 30, 93–124.
D. Bini (1980). Relations between exact and approximate bilinear algorithms. Applications. Calcolo 17(1), 87–97.
D. Bini, G. Lotti & F. Romani (1980). Approximate solutions for the bilinear form computational problem. SIAM J. Comput. 9(4), 692–697.
M. Bläser (2013). Fast Matrix Multiplication. Theory of Computing, Graduate Surveys 5, 1–60.
M. Bläser & V. Lysikov (2016). On degeneration of tensors and algebras. In 41st International Symposium on Mathematical Foundations of Computer Science, volume 58 of LIPIcs. Leibniz Int. Proc. Inform., Art. No. 19, 11. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern.
P. Bürgisser, M. Clausen & M. A. Shokrollahi (1997). Algebraic complexity theory, volume 315 of Grundlehren der Mathematischen Wissenschaften. Springer-Verlag, Berlin. ISBN 3-540-60582-7.
M. Christandl, F. Gesmundo & A. K. Jensen (2019). Border rank is not multiplicative under the tensor product. SIAM J. Appl. Alg. Geom. 3, 231–255.
M. Christandl, A. K. Jensen & J. Zuiddam (2018). Tensor rank is not multiplicative under the tensor product. Lin. Alg. Appl. 543, 125–139.
M. Christandl, P. Vrana & J. Zuiddam (2021). Barriers for Fast Matrix Multiplication from Irreversibility. Theory of Computing 17(2), 1–32.
H. Cohn & C. Umans (2003). A group theoretic approach to fast matrix multiplication. In Proc. of the 44th Symp. Found. Comp. Science, number 2, 438–449.
A. Conner, F. Gesmundo, J. M. Landsberg & E. Ventura (2019a). Tensors with maximal symmetries. arXiv:1909.09518.
A. Conner, F. Gesmundo, J. M. Landsberg, E. Ventura & Y. Wang (2021) Towards a geometric approach to Strassen’s asymptotic rank conjecture. Collectanea Mathematica 72(1), 63–86
A. Conner, A. Harper & J. M. Landsberg (2019b). New lower bounds for matrix multiplication and the \(3\times 3\) determinant. arXiv:1911.07981.
A. Conner, H. Huang & J. M. Landsberg (2020b). Bad and good news for Strassen’s laser method: Border rank of the \(3\times 3\) permanent and strict submultiplicativity. arXiv:2009.11391.
D. Coppersmith & S. Winograd (1990). Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9(3), 251–280.
H. Derksen (2016). On the nuclear norm and the singular value decomposition of tensors. Found. Comp. Math. 16(3), 779–811.
H. Derksen & V. Makam (2018). On non-commutative rank and tensor rank. Linear Multilinear Algebra 66(6), 1069–1084.
K. Efremenko, A. Garg, R. Oliveira & A. Wigderson (2018). Barriers for rank methods in arithmetic complexity. In 9th Innovations in Theoretical Computer Science, volume 94 of LIPIcs. Leibniz Int. Proc. Inform., Art. No. 1, 19. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern.
W. Fulton (1997). Young tableaux. With applications to representation theory and geometry, volume 35 of London Mathematical Society Student Texts. Cambridge University Press, Cambridge. ISBN 0-521-56144-2; 0-521-56724-6, x+260.
W. Fulton & J. Harris (1991). Representation theory: a first course, volume 129 of Graduate Texts in Mathematics. Springer-Verlag, New York.
D. A. Gay (1976). Characters of the Weyl group of \(SU(n)\) on zero weight spaces and centralizers of permutation representations. Rocky Mountain J. Math. 6(3), 449–455.
F. Gesmundo, C. Ikenmeyer & G. Panova (2017). Geometric complexity theory and matrix powering. Diff. Geom. Appl. 55, 106–127.
D. R. Grayson & M. E. Stillman (2020). Macaulay 2, a software system for research in algebraic geometry (Version 1.16. Available at http://www.math.uiuc.edu/Macaulay2/.
N. Ilten & Z. Teitler (2016). Product ranks of the \(3 \times 3\) determinant and permanent. Canad. Math, Bull. 59(2), 311–319.
G. Johns & Z. Teitler Z (2020). An improved upper bound for the Waring rank of the determinant. arXiv:2004.06158
S. Kopparty, G. Moshkovitz & J. Zuiddam (2020). Geometric Rank of Tensors and Subrank of Matrix Multiplication. In 35th Comp. Compl. Conf. (CCC 2020), volume 169 of LIPIcs. Leibniz Int. Proc. Inform., 35:1–35:21. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany.
J. M. Landsberg (2012). Tensors: Geometry and Applications, volume 128 of Graduate Studies in Mathematics. American Mathematical Society, Providence, RI.
J. M. Landsberg (2017). Geometry and complexity theory, volume 169 of Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge.
J. M. Landsberg & G. Ottaviani (2013). Equations for secant varieties of Veronese and other varieties. Ann. Mat. Pura Appl. (4) 192(4), 569–606. ISSN 0373-3114.
J. M. Landsberg & G. Ottaviani (2015). New lower bounds for the border rank of matrix multiplication. Th. of Comp. 11(11), 285–298.
F. Le Gall (2014). Powers of tensors and Fast Matrix Multiplication. In Proc. 39th Int. Symp. Symb. Alg. Comp., 296–303. ACM.
A. K. Lenstra, H. W. Lenstra Jr & L. Lovász (1982). Factoring Polynomials with Rational Coefficients. Math. Ann 261(4), 515-534.
K. D. Mulmuley & M. Sohoni (2008). Geometric Complexity Theory. II. Towards explicit obstructions for embeddings among class varieties. SIAM J. Comput. 38(3), 1175–1206. ISSN 0097-5397.
Sage Developers (2020). SageMath, the Sage Mathematics Software System (Version 9.0). Available at https://www.sagemath.org.
A. Schönhage (1981). Partial and total matrix multiplication. SIAM J. Comp. 10(3), 434–455.
A. Stothers (2010). On the Complexity of Matrix Multiplication. Ph.D. thesis, U. Edinburgh.
V. Strassen (1969). Gaussian elimination is not optimal. Numerische mathematik 13(4), 354–356.
V. Strassen (1983). Rank and optimal computation of generic tensors. Lin. Alg. Appl. 52/53, 645–685. ISSN 0024-3795.
V. Strassen (1987). Relative bilinear complexity and matrix multiplication. J. Reine Angew. Math. 375/376, 406–443.
V. Strassen (1988). The asymptotic spectrum of tensors. J. Reine Angew. Math. 384, 102–152.
V. Strassen (1991). Degeneration and complexity of bilinear maps: some asymptotic spectra. J. Reine Angew. Math. 413, 127–180. ISSN 0075-4102. URL https://doi.org/10.1515/crll.1991.413.127.
V. Strassen (1994). Algebra and complexity. In First European Congress of Mathematics Paris, July 6–10, 1992, 429–446. Springer.
V. V. Williams (2012). Multiplying matrices faster than Coppersmith–Winograd. In Proc. 44th ACM Symp. Th. Comp. – STOC’12, 887–898. ACM.
Acknowledgements
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.
Funding
Open Access funding enabled and organized by Projekt DEAL
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Conner, A., Gesmundo, F., Landsberg, J.M. et al. Rank and border rank of Kronecker powers of tensors and Strassen's laser method. comput. complex. 31, 1 (2022). https://doi.org/10.1007/s00037-021-00217-y
Received:
Published:
DOI: https://doi.org/10.1007/s00037-021-00217-y