An Almost Optimal Rank Bound for Depth-3 Identities

Nitin Saxena, C. Seshadhri

We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most k^3\log d. The previous best rank bound known was 2^{O(k^2)}(\log d)^{k-2} b…