TU Berlin

Fachgebiet Algorithmische AlgebraPublications

Inhalt des Dokuments

zur Navigation

Search for Publication

Suche nach Publikationen

All Publications

Permanent versus determinant, obstructions, and Kronecker coefficients
Zitatschlüssel B-Permanent-Versus-Determinant-Obstructions-And-Kronecker-Coefficients
Autor Peter Bürgisser
Jahr 2016
Journal Séminaire Lotharingien de Combinatoire
Jahrgang 75
Monat 05
Zusammenfassung We give an introduction to some of the recent ideas that go under the name ``geometric complexity theory''. We first sketch the proof of the known upper and lower bounds for the determinantal complexity of the permanent. We then introduce the concept of a representation theoretic obstruction, which has close links to algebraic combinatorics, and we explain some of the insights gained so far. In particular, we address very recent insights on the complexity of testing the positivity of Kronecker coefficients. We also briefly discuss the related asymptotic version of this question.
Link zur Publikation Link zur Originalpublikation Download Bibtex Eintrag



Schnellnavigation zur Seite über Nummerneingabe