Computer Science – Computational Complexity
Scientific paper
2012-04-19
Computer Science
Computational Complexity
15 pages
Scientific paper
For fixed compact connected Lie groups H \subseteq G, we provide a polynomial time algorithm to compute the multiplicity of a given irreducible representation of H in the restriction of an irreducible representation of G. Our algorithm is based on a finite difference formula which makes the multiplicities amenable to Barvinok's algorithm for counting integral points in polytopes. The Kronecker coefficients of the symmetric group, which can be seen to be a special case of such multiplicities, play an important role in the geometric complexity theory approach to the P vs. NP problem. Whereas their computation is known to be #P-hard for Young diagrams with an arbitrary number of rows, our algorithm computes them in polynomial time if the number of rows is bounded. We complement our work by showing that information on the asymptotic growth rates of multiplicities in the coordinate rings of orbit closures does not directly lead to new complexity-theoretic obstructions beyond what can be obtained from the moment polytopes of the orbit closures. Non-asymptotic information on the multiplicities, such as provided by our algorithm, may therefore be essential in order to find obstructions in geometric complexity theory.
Christandl Matthias
Doran Brent
Walter Michael
No associations
LandOfFree
Computing Multiplicities of Lie Group Representations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Computing Multiplicities of Lie Group Representations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Multiplicities of Lie Group Representations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-35198