An $\Omega(n^{4/3})$ lower bound on the monotone network complexity of the n^th degree convolution

We prove an $\Omega(n^{4/3})$ lower bound on the number of $\wedge$-gates in any monotone network computing the n^th degree convolution.