For SO(n)SO(n) a calculation using LiE gives:
(using partition notation so WW is [2])
and assuming nn is not small
For WotimesWWotimesW, [4],[3,1],[2,2],[2],[1,1],[]
(all with multiplicity one)
and for WotimesWotimesWWotimesWotimesW,
1.[6] 2.[5,1] 3.[4,2] 1.[3,3] 1.[4,1,1] 2.[3,2,1] 1.[2,2,2] 3.[4] 6.[3,1] 2.[2,2] 3.[2,1,1] 6.[2] 3.[1,1] 1.[]
The same works for Sp(n)Sp(n) by taking conjugate partitions.
There is also a relationship with SL(n)SL(n).
This is taking your question at face value. If it is understanding you're after instead then the best approach is to use crystal graphs.
The notation I have used denotes a representation by a partition. I have put m.m. in front to denote multiplicity is mm. A partition is [a1,a2,a3,...][a1,a2,a3,...] where aigeajaigeaj if ii less than jj. To convert to a highest weight vector add the appropriate number of 00s to the end.
Then take [a1−a2,a2−a3,a3−a4,...][a1−a2,a2−a3,a3−a4,...]. This gives a dominant integral weight. The fundamental weights are the partitions [1,,,,1][1,,,,1]. If this has length kk this corresponds to the kk-th exterior power of the vector representation (provided 2k−12k−1 less than nn).
In particular the trivial representation is [][], the vector representation VV is [1][1], the exterior square of VV is [1,1][1,1], the symmetric square is [2]+[][2]+[].
For the kk-th tensor power of WW you will see partitions of 2k−2p2k−2p for 0leplek0leplek only and it remains to determine the multiplicities (possibly 00). For SL(n)SL(n) just take the partitions of 2k2k (with their multiplicities) and ignore the rest.
No comments:
Post a Comment