A lower bound for the determinantal complexity of a hypersurface

Singularities of surfaces or higher-dimensional varieties (14J17) Hypersurfaces and algebraic geometry (14J70) Determinantal varieties (14M12) Computational aspects of higher-dimensional varieties (14Q15) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Abstract: We prove that the determinantal complexity of a hypersurface of degree

d > 2

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 i m e s 3

permanent is

7

. We also prove that for

n > 3

, there is no nonsingular hypersurface in

m a t h b f P^{n}

of degree

d

that has an expression as a determinant of a

d i m e s d

matrix of linear forms while on the other hand for

n l e 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

.

Review text

The aim of this article is to give a lower bound for the determinantal complexity of a hypersurface of degree \(d>2\). Let \(k\) be a field and let \(f\in k[x_1,\ldots,x_n]\) be a homogeneous polynomial. The singular locus of the hypersurface \(V(f)\subseteq k^{n}\) is denoted by \(\mathrm{Sing}(f)\); the determinal complexity of the polynomial \(f\) is denoted by \(\mathrm{dc}(f)\). The first theorem of this paper states that for a hypersurface with singular locus of codimension at least 5 the determinantal complexity is bounded below by one more than the codimension of its singular locus in other words: for a homogeneous polynomial \(f\in k[x_1,\ldots,x_n]\) if \(\mathrm{codim}(f)>4\), then \(\mathrm{dc}(f)\geq\mathrm{codim(Sing}(f))+1\). The second fundamental result of this paper (appearing in theorem 2) states that for \(n>3\) there is no smooth (i.e. non singular) degree \(d\) projective hypersurface that has an expression as a determinant of a square matrice of linear forms of size \(d\). As for \(n<4\) a general determinantal expression is nonsingular. Lastly, an answer to an open question of Ressayre is given. This question concerns the determinantal complexity of the unique projective cubic surface containing a single line and determined by the polynomial \(f=xy^2+yt^2+z^3\), where \([x:y:z:t]\) are the homogeneous coordinates in \(\mathbb{P}^{3}\). It is shown that the determinantal complexity of this cubic surface is 5.

Recommendations

Cites work

Cited in

(19)

This page was built for publication: A lower bound for the determinantal complexity of a hypersurface

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