A Lower Bound on Determinantal Complexity

DOI10.1007/S00037-022-00228-3MaRDI QIDQ6348447arXivFDO

Authors Mrinal Kumar, Ben Lee Volk

Publication date 4 September 2020

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Networks and circuits as models of computation; circuit complexity (68Q06)

Abstract: The determinantal complexity of a polynomial $PinmathbbF[x_1,ldots,x_n]$ over a field $mathbbF$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $mathbbF[x_1,ldots,x_n]$ such that $P=Det(M)$. We prove that the determinantal complexity of the polynomial $su{m}_{i=1}^n{x}_i^n$ is at least $1.5n-3$. For every $n$-variate polynomial of degree $d$, the determinantal complexity is trivially at least $d$, and it is a long standing open problem to prove a lower bound which is super linear in $maxn,d$. Our result is the first lower bound for any explicit polynomial which is bigger by a constant factor than $maxn,d$, and improves upon the prior best bound of $n+1$, proved by Alper, Bogart and Velasco [ABV17] for the same polynomial.

This page was built for publication: A Lower Bound on Determinantal Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6348447)