Advanced search
Publication Cover
Experimental Mathematics Volume 30, 2021 - Issue 3
Submit an article Journal homepage
67
Views
1
CrossRef citations to date
0
Altmetric
Original Articles

A Rank 18 Waring Decomposition of sM〈3〉 with 432 Symmetries

Austin ConnerDepartment of Mathematics, Texas A&M University, College Station, TX, USACorrespondence[email protected]
Pages 383-385 | Published online: 05 Apr 2019

References

  • [Ambainis et al. 15] A. Ambainis, Y. Filmus, and F. Le Gall. “Fast Matrix Multiplication: Limitations of the Coppersmith-Winograd Method (Extended Abstract).” Symposium on Theory of Computing. New York: ACM, 2015, pp. 585–593. MR 3388238.
  • [Bini et al. 79] D. Bini, M. Capovani, F. Romani, and G. Lotti. “O(n2.7799) Complexity for n×n Approximate Matrix Multiplication.” Inform. Process. Lett. 8 (1979), 234–235. MR MR534068 (80h:68024).
  • [Chiantini et al. 17] L. Chiantini, J. D. Hauenstein, C. Ikenmeyer, J. M. Landsberg, and G. Ottaviani, “Polynomials and the Exponent of Matrix Multiplication.” arXiv:1706.05074v1 2017, to appear in Bulletin of LMS.
  • [Coppersmith and Winograd 90] D. Coppersmith and S. Winograd. “Matrix Multiplication Via Arithmetic Progressions.” J. Symb. Comput. 9:3 (1990), 251–280. MR 91i:68058.
  • [Gesmundo et al. 17] F. Gesmundo, C. Ikenmeyer, and G. Panova. “Geometric Complexity Theory and Matrix Powering.” Diff. Geom. Appl. 55 (2017), 106–127.
  • [Hesse 44] O. Hesse. “Über die Elimination der Variabeln aus drei algebraischen Gleichungen vom zweiten Grade mit zwei Variabeln.” J. Reine Angew. Math. 28 (1844), 68–96, ISSN 0075-4102. doi:10.1515/crll.1844.28.68
  • [Le Gall 14] F. Le Gall. “Powers of Tensors and Fast Matrix Multiplication.” ISSAC 2014—Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation. New York: ACM, 2014, pp. 296–303. MR 3239939.
  • [Schönhage 81] A. Schönhage. “Partial and Total Matrix Multiplication.” SIAM J. Comput. 10:3 (1981), 434–455. MR MR623057 (82h:68070).
  • [Stothers 10] A. Stothers. “On the Complexity of Matrix Multiplication,” Ph.D. thesis, University of Edinburgh, 2010. http://hdl.handle.net/1842/4734
  • [Strassen 69] V. Strassen. “Gaussian Elimination is Not Optimal.” Numer. Math. 13 (1969), 354–356. MR 40 #2223.
  • [Strassen 87] V. Strassen. “Relative Bilinear Complexity and Matrix Multiplication.” J. Reine Angew. Math. 375/376 (1987), 406–443. MR MR882307 (88h:11026).
  • [Williams 11] V. Williams. “Breaking the Coppersmith-Winograd barrier.” Unpublished manuscript, 2011, http://theory.stanford.edu/∼virgi/matrixmult-f.pdf

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.