A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits

We construct an explicit polynomial f(x
₁
,..., x
_n
), with coefficients in {0, 1}, such that the size of any syntactically multilinear arithmetic circuit computing f is at least Omega{n
^4/3
log
²
n} The lower bound holds over any field.