Last update: 17 September 2013
Fix A Brauer diagram on dots is a graph on two rows of one above the other, and edges such that each vertex is incident to precisely one edge. The product of two and is obtained by placing above and identifying the vertices in the bottom row of with the corresponding vertices in the top row of The resulting graph contains paths and some number of closed loops. If is the with the edges that are the paths in this graph but with the closed loops removed, then the product is given by For example, if then
The Brauer algebra is the span of the with multiplication given by the linear extension of the diagram multiplication. The dimension of the Brauer algebra is since the number of is
The diagrams in which have all their edges connecting top vertices to bottom vertices form a symmetric group The elements generate the Brauer algebra
Theorem B6.1. The Brauer algebra has a presentation as an algebra by generators and relations
There are two different Brauer algebra analogues of the Schur Weyl duality theorem, Theorem A5.1. In the first one the orthogonal group plays the same role that played in the and in the second, the symplectic group takes the role.
Let be the orthogonal group and let be the usual representation of the group There is an action of the Brauer algebra on which commutes with the action of on
Theorem B6.2.
(a) | The action of on generates |
(b) | The action of on generates |
Let be the symplectic group and let be the usual representation of the group There is an action of the Brauer algebra on which commutes with the action of on
Theorem B6.3.
(a) | The action of on generates |
(b) | The action of on generates |
Theorem B6.4. The Brauer algebra is semisimple if
Partial results for
The following results giving answers to the main questions (Ia-c) for the Brauer algebras hold when is such that is semisimple.
(a) | How do we index/count them? |
There is a bijection | |
(b) | What are their dimensions? |
The dimension of the irreducible representation is given by where is the hook length at the box in An up-down tableau of shape and length is a sequence of partitions, such that each partition in the sequence differs from the previous one by either adding or removing a box. | |
(c) | What are their characters? |
A Murnaghan-Nakayama type rule for the characters of the Brauer algebras was given in [Ram1995]. |
References
(1) | The Brauer algebra was defined originally by R. Brauer [Bra1937] in 1937. H. Weyl treats it in his book [Wey1946]. |
(2) | The Schur-Weyl duality type theorems are due to Brauer [Bra1937], from his original paper. See also [Ram1995] for a detailed description of these Brauer algebra actions. |
(3) | The theorem giving values of x for which the Brauer algebra is semisimple is due to Wenzl, see [Wen1988-2]. |
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..