A Lower Bound for the Determinantal Complexity of a Hypersurface

作者:Alper Jarod; Bogart Tristram*; Velasco Mauricio
来源:Foundations of Computational Mathematics, 2017, 17(3): 829-836.
DOI:10.1007/s10208-015-9300-x

摘要

We prove that the determinantal complexity of a hypersurface of degree is bounded below by one more than the codimension of the singular locus, provided that this codimension is at least 5. As a result, we obtain that the determinantal complexity of the 3 x 3 permanent is 7. We also prove that for n > 3 there is no nonsingular hypersurface in p(n) of degree d x d that has an expression as a determinant of a matrix of linear forms, while on the other hand for n <= 3, a general determinantal expression is nonsingular. Finally, we answer a question of Ressayre by showing that the determinantal complexity of the unique (singular) cubic surface containing a single line is 5.

  • 出版日期2017-6