Timeline for Highest weights of the restriction of an irreducible representation of a simple group to a Levi subgroup
Current License: CC BY-SA 2.5
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 24, 2010 at 2:04 | comment | added | Allen Knutson | I think the simplest answer is that even for tensor product questions, we don't have a reasonable handle on the vertices of the resulting polytope, just the facets. If you want the list of facets for a general branching problem, check out Ressayre's article arxiv.org/abs/0903.1187 I haven't thought about how that list might simplify for a Levi. | |
| Aug 23, 2010 at 20:37 | comment | added | Sasha | Allen, thanks a lot! You convinced me that the problem is more complicated than I thought. Although it seems slightly strange for me - I somehow believed that the branching problem is very similar to the problem of decomposing a tensor product (and in type A even equivalent, is it true?). Now, for tensor product we have a very nice restriction, so why don't we have something similar for branching? | |
| Aug 17, 2010 at 14:51 | history | answered | Allen Knutson | CC BY-SA 2.5 |