724 research outputs found
Computing the homology of basic semialgebraic sets in weak exponential time
We describe and analyze an algorithm for computing the homology (Betti
numbers and torsion coefficients) of basic semialgebraic sets which works in
weak exponential time. That is, out of a set of exponentially small measure in
the space of data the cost of the algorithm is exponential in the size of the
data. All algorithms previously proposed for this problem have a complexity
which is doubly exponential (and this is so for almost all data)
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
Even Partitions in Plethysms
We prove that for all natural numbers k,n,d with k <= d and every partition
lambda of size kn with at most k parts there exists an irreducible GL(d,
C)-representation of highest weight 2*lambda in the plethysm Sym^k(Sym^(2n)
(C^d)). This gives an affirmative answer to a conjecture by Weintraub (J.
Algebra, 129 (1):103-114, 1990). Our investigation is motivated by questions of
geometric complexity theory and uses ideas from quantum information theory.Comment: 9 page
- …