@inproceedings{BIP-No-Occurrence-Obstructions-In-Geometric-Complexity-Theory,
Title = {No occurrence obstructions in geometric complexity theory},
Author = {Peter Bürgisser and Christian Ikenmeyer and Greta Panova},
Booktitle = {Proceedings 57th Annual IEEE Symposium on Foundations of Computer Science},
Pages = {386–395},
Year = {2016},
Month = {04},
Note = {To appear in J. AMS.},
Abstract = {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, 2008) 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 in [33].},
Url = {http://arxiv.org/abs/1604.06431},
Url2 = {http://www3.math.tu-berlin.de/algebra/work/nooccobs.pdf},
Reviewed = {True}
}