Combinatorial Representation Theory

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

Last update: 17 September 2013

Appendix B

B1. Coxeter groups, groups generated by reflections, and Weyl groups

A Coxeter group is a group W presented by generators S={s1,,sn} and relations si2=1, for1in, (sisj)mij=1, for1ijn, where each mij is either or a positive integer greater than 1.

A reflection is a linear transformation of n which is a reflection in some hyperplane.

A finite group generated by reflections is a finite subgroup of GL(n,) which is generated by reflections.

Theorem B1.1. The finite Coxeter groups are exactly the finite groups generated by reflections.

A finite Coxeter group is irreducible if it cannot be written as a direct product of finite Coxeter groups.

Theorem B1.2. (Classification of finite Coxeter groups)

(a) Every finite Coxeter group can be written as a direct product of irreducible finite Coxeter groups.
(b) There is one irreducible finite Coxeter group corresponding to each of the following “types” An-1, Bn, Dn, E6, E7, E8, F4, H3, H4, I2(m).

The irreducible finite Coxeter groups of classical type are the ones of types An-1, Bn, and Dn and the others are the irreducible finite Coxeter groups of exceptional type.

(a) The group of type An-1 is the symmetric group Sn.
(b) The group of type Bn is the hyperoctahedral group (/2)Sn, the wreath product of the group of order 2 and the symmetric group Sn. It has order 2nn!.
(c) The group of type Dn is a subgroup of index 2 in the Coxeter group of type Bn.
(d) The group of type I2(m) is a dihedral group of order 2m.
A finite group W generated by reflections in n is crystallographic if there is a lattice in n which is stable under the action of W. The crystallographic finite Coxeter groups are also called Weyl groups. The irreducible Weyl groups are the irreducible finite Coxeter groups of types An-1, Bn, Dn, E6, E7, E8, F4, G2= I2(6).

References

The most comprehensive reference for finite groups generated by reflections is [Bou1968]. See also the book of Humphreys [Hum1990].

Notes and references

This is the survey paper Combinatorial Representation Theory, written by Hélène Barcelo and Arun Ram.

Key words and phrases. Algebraic combinatorics, representations.

Barcelo was supported in part by National Science Foundation grant DMS-9510655.
Ram was supported in part by National Science Foundation grant DMS-9622985.
This paper was written while both authors were in residence at MSRI. We are grateful for the hospitality and financial support of MSRI..

page history