direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Ehemalige Mitarbeiter

Dr. Christian Ikenmeyer


Max-Planck-Institut für Informatik
Department 1: Algorithms and Complexity
Campus E1 4, Room 311D
66123 Saarbrücken
Persönliche Homepage

Publikationen in der Arbeitsgruppe

No occurrence obstructions in geometric complexity theory
Zitatschlüssel BIP-No-Occurrence-Obstructions-In-Geometric-Complexity-Theory
Autor Peter Bürgisser and Christian Ikenmeyer and Greta Panova
Buchtitel Proceedings 57th Annual IEEE Symposium on Foundations of Computer Science
Seiten 386–395
Jahr 2016
Monat 04
Notiz To appear in J. AMS.
Zusammenfassung 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].
Link zur Publikation Link zur Originalpublikation Download Bibtex Eintrag

Zusatzinformationen / Extras


Schnellnavigation zur Seite über Nummerneingabe