4 research outputs found
Binary Determinantal Complexity
We prove that for writing the 3 by 3 permanent polynomial as a determinant of
a matrix consisting only of zeros, ones, and variables as entries, a 7 by 7
matrix is required. Our proof is computer based and uses the enumeration of
bipartite graphs. Furthermore, we analyze sequences of polynomials that are
determinants of polynomially sized matrices consisting only of zeros, ones, and
variables. We show that these are exactly the sequences in the complexity class
of constant free polynomially sized (weakly) skew circuits.Comment: 10 pages, C source code for the computation available as ancillary
file
A lower bound for the determinantal complexity of a hypersurface
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 . As a result, we obtain that the
determinantal complexity of the permanent is . We also prove
that for , there is no nonsingular hypersurface in of
degree that has an expression as a determinant of a matrix of
linear forms while on the other hand for , 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 .Comment: 7 pages, 0 figure
Rectangular Kronecker coefficients and plethysms in geometric complexity theory
We prove that in the geometric complexity theory program the vanishing of
rectangular Kronecker coefficients cannot be used to prove superpolynomial
determinantal complexity lower bounds for the permanent polynomial.
Moreover, we prove the positivity of rectangular Kronecker coefficients for a
large class of partitions where the side lengths of the rectangle are at least
quadratic in the length of the partition. We also compare rectangular Kronecker
coefficients with their corresponding plethysm coefficients, which leads to a
new lower bound for rectangular Kronecker coefficients. Moreover, we prove that
the saturation of the rectangular Kronecker semigroup is trivial, we show that
the rectangular Kronecker positivity stretching factor is 2 for a long first
row, and we completely classify the positivity of rectangular limit Kronecker
coefficients that were introduced by Manivel in 2011.Comment: 20 page
No occurrence obstructions in geometric complexity theory
The permanent versus determinant conjecture is a major problem in complexity
theory that is equivalent to the separation of the complexity classes VP_{ws}
and VNP. Mulmuley and Sohoni (SIAM J. Comput., 2001) suggested to study a
strengthened version of this conjecture over the complex numbers that amounts
to separating the orbit closures of the determinant and padded permanent
polynomials. In that paper it was also proposed to separate these orbit
closures by exhibiting occurrence obstructions, which are irreducible
representations of GL_{n^2}(C), which occur in one coordinate ring of the orbit
closure, but not in the other. We prove that this approach is impossible.
However, we do not rule out the general approach to the permanent versus
determinant problem via multiplicity obstructions as proposed by Mulmuley and
Sohoni.Comment: Substantial revision. This version contains an overview of the proof
of the main result. Added material on the model of power sums. Theorem 4.14
in the old version, which had a complicated proof, became the easy Theorem
5.4. To appear in the Journal of the AM