An $n^2\log\log n$ Lower Bound for Permanent Circuits with Valid Division

We prove an $n^2\log\log n$ lower bound for rational arithmetic circuits computing the permanent over characteristic zero. Additions and scalar operations are free, while every nonscalar multiplication or valid division has unit cost. If $L_{\mathrm{div}}(\mathrm{per}_n)$ denotes the resulting compl