The rank of n n matrix multiplication is at least 3n^2 - 22n^32 - 3n

Abstract: For every

p l e q n

positive integer we obtain the lower bound

for the rank of the

n i m e s n

matrix multiplication. This bound improves the previous one

due to Landsberg. Furthermore our bound improves the classic bound

f r a c 52 n^{2} - 3 n

, due to Bl"aser, for every

n g e q 132

. Finally, for

p = 2

, with a sligtly different strategy we menage to obtain the lower bound

f r a c 83 n^{2} - 7 n

which improves Bl"aser's bound for any

n g e q 24

.

Recommendations

Cites work

Cited in

(17)

This page was built for publication: The rank of \(n \times n\) matrix multiplication is at least \(3n^2 - 2\sqrt{2}n^{\frac{3}{2}} - 3n\)