Bilinear mincing rank (Q1115593)

A bilinear form f can always be computed by bilinear straightline algorithms. The minimal length of such an algorithm is called the bilinear circuit size of f. In this paper, the ``mincing rank'' of bilinear forms over fields of characteristic zero is defined (too complex to be repeated here). The mincing rank of a bilinear form f which is a purely algebraic-combinatoric notion turns out to be a lower bound on the bilinear circuit size complexity of f. It is expected to yield nontrivial linear bounds for specific forms of interest.