11 2015. to appear in SIAM Journal of Computing.

Paper abstract bibtex

Paper abstract bibtex

We show that the problem of deciding membership in the moment polytope associated with a finite-dimensional unitary representation of a compact, connected Lie group is in NP and coNP. This is the first non-trivial result on the computational complexity of this problem, which naively amounts to a quadratically-constrained program. Our result applies in particular to the Kronecker polytopes, and therefore to the problem of deciding positivity of the stretched Kronecker coefficients. In contrast, it has recently been shown that deciding positivity of a single Kronecker coefficient is NP-hard in general [Ikenmeyer, Mulmuley and Walter, arXiv:1507.02955]. We discuss the consequences of our work in the context of complexity theory and the quantum marginal problem.

@UNPUBLISHED{BCMW-Membership-In-Moment-Polytopes-Is-In-Np-And-Conp, TITLE={Membership in moment polytopes is in NP and coNP}, URL={http://arxiv.org/abs/1511.03675}, YEAR={2015}, AUTHOR={Peter Bürgisser and Matthias Christandl and Ketan D. Mulmuley and Michael Walter}, NOTE={to appear in SIAM Journal of Computing.}, ABSTRACT={We show that the problem of deciding membership in the moment polytope associated with a finite-dimensional unitary representation of a compact, connected Lie group is in NP and coNP. This is the first non-trivial result on the computational complexity of this problem, which naively amounts to a quadratically-constrained program. Our result applies in particular to the Kronecker polytopes, and therefore to the problem of deciding positivity of the stretched Kronecker coefficients. In contrast, it has recently been shown that deciding positivity of a single Kronecker coefficient is NP-hard in general [Ikenmeyer, Mulmuley and Walter, arXiv:1507.02955]. We discuss the consequences of our work in the context of complexity theory and the quantum marginal problem. }, MONTH={11} }

Downloads: 0