| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4599949 | Linear Algebra and its Applications | 2013 | 10 Pages |
Abstract
We prove that the rank of the n×n matrix multiplication is at least . The previous bounds were due to Landsberg [2], and due to Bläser [1]. Our bound improves the previous bounds for any n⩾24.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
