Permanent versus determinant, obstructions, and Kronecker coefficients

zbMath1362.68089arXiv1511.08113MaRDI QIDQ726486

Peter Bürgisser

Publication date: 11 July 2016

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.08113

zbMATH Keywords

representationsYoung tableauxorbit closuresplethysmsKronecker coefficientsgeometric complexity theoryhighest weight vectorspermanent versus determinant

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Representations of finite symmetric groups (20C30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

A Determinantal Identity for the Permanent of a Rank 2 Matrix ⋮ Rectangular Kronecker coefficients and plethysms in geometric complexity theory ⋮ On vanishing of Kronecker coefficients ⋮ On the largest Kronecker and Littlewood-Richardson coefficients

This page was built for publication: Permanent versus determinant, obstructions, and Kronecker coefficients