The Hyperoctahedral Group

Arun Ram
Department of Mathematics and Statistics
University of Melbourne
Parkville, VIC 3010 Australia
aram@unimelb.edu.au

Last update: 31 March 2012

The Hyperoctahedral Group

The hyperoctahedral group WBn is the group of signed permutations of 1,2,...,n, i.e. bijections w: {-n,...,-2,-1,1,2,...,n} {-n,...,-2,-1,1,2,...,n} such that w(-i) = -w(i). There are multiple notations for signed permutations

  1. Two line notations: where w(i) in the second line is below i in the first line, for 1in. w= 1 2 3 4 5 6 3 -1 5 -6 2 -4
  2. In cycle notation as permutations in the symmetric group S2n. w= (1,3,5,2,-1,-3,-5,-2) (4,-6).
  3. Matrix notation: where the (|w(i)|,i) entry is 1 if w(i) is positive and -1 if w(i) is negative, and all other entries are 0. w= 0 -1 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 -1 0 0 1 0 0 0 0 0 0 -1 0 0
  4. Diagram notation: where the ith dot in the top row is connected to the |w(i)|th dot in the bottom row and the edge is labeled by -1 if w(i) is negative. w= -1 -1 -1
The hyperoctahedral group is also called the Weyl group of type Bn and the Weyl group of type Cn and is the same as the group On() = {AMn()  |  AAt=Id}. It is the group of n×n matrices such that
  1. there is exactly one nonzero entry in each row and each column,
  2. each nonzero entry is ±1.
The group WBn is isomorphic to the wreath product (/2)Sn and has order 2nn!.

The reflections in WBn are the elements sεi = (i,-i) sεi-εj = (i,j) (-i,-j), sεi+εj = (i,-j) (-i,j). The simple reflections are s1 = (1,-1) = -1 and si = (i-1,i) = for 2in.

The hyperoctahedral group WBn can be presented by generators s1,s2,...,sn-1 and relations sisj = sjsi, if   |i-j|>1, sisi+1si = si+1sisi+1, 2in-1, s1s2s1s2 = s2s1s2s1, si2 = 1, 1in.

Proof.
There are three things to show:
  1. The simple reflections in WBn satisfy the given relations.
  2. The simple reflections in WBn generate WBn.
  3. The group given by generators s1,...,sn and the relations in the statement has 2nn!.

  1. The following pictures show that s1,...,sn WBn satisfy the relations in the statement of the theorem. -1 -1 = -1 = -1 = -1 -1 -1 = -1 -1 = -1 -1
  2. For each 1in let ti = (i,-i) = -1 ith = sisi-1s3s2s1s2s3si-1si. Every wWBn can be written as w = πti1tik where πSn is the permutation given by π(i) = |w(i)| and {i1,...,ik} = {i  |  w(i)   is negative }. Pictorially w = -1 -1 -1 = -1 -1 -1 = πt1t3t6 Since s2,...,sn generate Sn and tk = sks2s1s2sk for 1kn, it follows that s1,...,sn generate WBn.
  3. Let Gn be the free group generated by s1,...,sn modulo the relations in the statement of the theorem. We will show that every element wGn is either
    1. wGn-1,
    2. w = w1snsn-1sk, with w1Gn-1,   2kn,
    3. w = w1snsn-1s2s1s2sk, with w1Gn-1,   1kn.
    Let wGn and assume that w = w1snw2snw3snwl-1snwl, where   wjGn-1. First we will show that every element of Gn can be written in the form w = w1snw2sn, with   w1,w2Gn-1. Suppose w = w1snw2snw3, with w1,w2,w3 Gn-2. Then, by the induction assumption, w = w1snasn-1bsn-1sncsn-1dsn-1 = w1asn sn-1b sn-1c snsn-1dsn-1 = w1asnxsn-1ysn-1snsn-1dsn-1 = w1axsnsn-1ysnsn-1sndsn-1 = w1axsnsn-1snysn-1sndsn-1 = w1axsn-1 sn sn-1ysnd snsn-1 = Asnβsn-1γsn-1snsn-1 = Aβsnsn-1γsnsn-1sn = Aβsnsn-1snγsn-1sn = Aβsn-1 sn sn-1γsn-1 sn = w1sn w2sn. It follows that if w = w1snw2snw3sn with w1, w2, w3 Gn-2 then w = w1sn w2sn sn = w1sn w2. Then, by the induction assumption w = w1sn w2sn, with
    1. w2Gn-2, or
    2. w2 = asn-1 sk and aGn-2, or
    3. w2 = asn-1 s2s1s2 sk and aGn-2.

    1. Case 1. w = w1snw2sn = w1w2snsn = w1w2 Gn-1.
    2. Case 2. w = w1sna sn-1sksn = w1asn sn-1 snsn-2sk = w1asn-1sn sn-1 sn-2 sk = w1 snsn-1 sk, with w1 Gn-1.
    3. Case 3. w = w1sna sn-1 s2s1s2 sksn = { w1asn sn-1 snsn-2 s2s1s2sk, if   k<n-1, w1asn sn-1 s2s1s2 sn-1sn, if   k=n-1, } = { w1a sn-1 sn sn-1 sn-2 s2s1s2sk, if   k<n-1, w1asn sn-1 s2s1s2 sn-1sn, if   k=n-1, } = w1a sn sn-1 s2s1s2sk, with w1 Gn-1.
    So Card(Gn) Card(Gn-1)2n. So Card(Gn) 2nn!.

Let (α,β) be a pair of partitions sucht that the total number of boxes in α and β is n. A standard tableau of shape (α,β) is a filling T of the boxes of α and β with 1,2,...,n such that, in each partition,

  1. the rows of T are increasing left to right,
  2. the columns of T are increasing top to bottom.
T = 1 5 7 4 10 12 8 13 α 2 3 9 6 11 β The rows and columns of each partition are indexed as for matrices, T(i) = box containing   i   in   T, c(b) = j-i,   if the box   b   is in position   (i,j), sgn(b) = { 1, if   b   is in   α, -1, if   b   is in   β. } The numbers c(b) and sgn(b) are the content and the sign of the box b, respectively. 0 1 2 -1 0 1 -2 -1 0 1 2 -1 0 Contents of boxes 1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 Signs of boxes

  1. The irreducible representations S(α,β) of the hyperoctahedral group WBn are indexed by pairs of partitions (α,β) with n boxes total.
  2. dim S(α,β)=# of standard tableaux of shape (α,β).
  3. The irreducible WBn-module S(α,β) is given by S(α,β) = -span {vT  |  T  is a standard tableau of shape   (α,β)} with basis {vT} and with WBn action given by s1vT = sgn(T(1))vT, sivT = (si)TTvT + (1+(si)TT) vsiT, i=2,3,...,n, where
    1. s1=(1,-1) and si=(i,i-1)(-i,-(i-1)),
    2. (si)TT = { 1 c(T(i))-c(T(i-1)) , if   sgn(T(i)) = sgn(T(i-1)), 0, if   sgn(T(i)) sgn(T(i-1)), }
    3. c(T(i)) is the content of the box containing i in T,
    4. sgn(T(i)) is the sign of the box containing i in T,
    5. siT is the same as T except that i and i-1 are switched, and
    6. vsiT=0, if siT is not a standard tableau.

Proof.
We must show that
  1. The S(α,β) are WBn modules,
  2. The S(α,β) are irreducible WBn modules,
  3. The S(α,β) are inequivalent WBn modules,
  4. These are all the simple WBn modules.
The proofs are similar to the proofs of the analogous statements in the symmetric group case.

Define elements xk, yk, 1kn, in the group algebra of the hyperoctahedral group WBn by yk = (k,-k), for   1kn, x1 = 0, and, xk = i<k (i,k) (-i,-k) + (i,-k) (-i,k), 2kn. The action of these elements of the WBn-module S(α,β) is given by ykvT = sgn(T(k))vT and xkvT = c(T(k))vT, where sgn(T(k)) and c(T(k)) are the sign and the content of the box containing k in T, respectively.

Proof.
By induction ykvT = skyk-1skvT = skyk-1 ((sk)TTvT + (1+(sk)TT)vskT) = sk (sgn(T(k-1)) (sk)TT + sgn(T(k)) (1+(sk)TT)vskT) = sgn(T(k))sk ( skvT + (sgn(T(k-1)) -sgn(T(k))) ( 1+sgn(T(k)) sgn( T(k-1) )) c(T(k)) -c( T(k-1)) )vT = sgn(T(k))vT.

Note that dim(S(α,β)) = ( n|α| ) fαfβ, where fα is the number of standard tableaux of shape α. Thus fα is the dimension of the irreducible module Sα for the symmetric group S|α|. Then α,β dim(S(α,β))2 = α,β ( n|α| )2 (fα)2 (fβ)2 = k=0n ( nk )2 αk (fα)2 βn-k (fβ)2 = k=0n n! k!(n-k)! k!(n-k)! (nk) = k=0n n!(nk) = 2nn!.

Notes and References

Where are these from?

References

References?

page history