NEW LOWER BOUNDS FOR THE RANK OF MATRIX MULTIPLICATION

被引：16
|
作者：
Landsberg, J. M. [1 ]
机构：
[1] Texas A&M Univ, Dept Math, College Stn, TX 77843 USA
来源：
SIAM JOURNAL ON COMPUTING | 2014年 / 43卷 / 01期
基金：
美国国家科学基金会;
关键词：
rank; matrix multiplication;
D O I：
10.1137/120880276
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The rank of the matrix multiplication operator for n x n matrices is one of the most studied quantities in algebraic complexity theory. I prove that the rank is at least 3n(2) - o(n(2)). More precisely, for any integer p <= n - 1 the rank is at least (3 - 1/p+1)n(2) - (1 + 2p(2p/p-1))n. The previous lower bound, due to Blaser, was 5/2n(2) - 3n ( the case p = 1). The new bounds improve Blaser's bound for all n > 84. I also prove lower bounds for rectangular matrices that are significantly better than the previous bound.
引用
收藏
页码：144 / 149
页数：6
相关论文
共 50 条
  • [31] Lower bounds in minimum rank problems
    Mitchell, Lon H.
    Narayan, Sivaram K.
    Zimmer, Andrew M.
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2010, 432 (01) : 430 - 440
  • [32] Equations for Lower Bounds on Border Rank
    Hauenstein, Jonathan D.
    Ikenmeyer, Christian
    Landsberg, J. M.
    [J]. EXPERIMENTAL MATHEMATICS, 2013, 22 (04) : 372 - 383
  • [33] Lower Bounds on the Mean-Squared Error of Low-Rank Matrix Reconstruction
    Tang, Gongguo
    Nehorai, Arye
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2011, 59 (10) : 4559 - 4571
  • [34] Brief Announcement: Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds
    Al Daas, Hussam
    Ballard, Grey
    Grigori, Laura
    Kumar, Suraj
    Rouse, Kathryn
    [J]. PROCEEDINGS OF THE 34TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, SPAA 2022, 2022, : 445 - 448
  • [35] Set-Multilinear and Non-commutative Formula Lower Bounds for Iterated Matrix Multiplication
    Tavenas, Sebastien
    Limaye, Nutan
    Srinivasan, Srikanth
    [J]. PROCEEDINGS OF THE 54TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '22), 2022, : 416 - 425
  • [36] Geometric Rank of Tensors and Subrank of Matrix Multiplication
    Kopparty, Swastik
    Moshkovitz, Guy
    Zuiddam, Jeroen
    [J]. DISCRETE ANALYSIS, 2023, : 1 - 25
  • [37] SPARSE-MATRIX VECTOR MULTIPLICATION ON DISTRIBUTED ARCHITECTURES - LOWER BOUNDS AND AVERAGE COMPLEXITY RESULTS
    MANZINI, G
    [J]. INFORMATION PROCESSING LETTERS, 1994, 50 (05) : 231 - 238
  • [38] On some bounds for symmetric tensor rank of multiplication in finite fields
    Ballet, Stephane
    Pieltant, Julia
    Rambaud, Matthieu
    Sijsling, Jeroen
    [J]. ARITHMETIC, GEOMETRY, CRYPTOGRAPHY AND CODING THEORY, 2017, 686 : 93 - 121
  • [39] Upper and lower bounds for the rank of the matrix-valued function A plus BXC when X has a fixed rank
    Tian, Yongge
    [J]. LINEAR & MULTILINEAR ALGEBRA, 2017, 65 (10): : 2101 - 2113
  • [40] Lower bounds for matrix product
    Shpilka, A
    [J]. SIAM JOURNAL ON COMPUTING, 2003, 32 (05) : 1185 - 1200
12345