Last update: 17 September 2013
Abstract: We attempt to survey the field of combinatorial representation theory, describe the main results and main questions and give an update of its current status. We give a personal viewpoint on the field, while remaining aware that there is much important and beautiful work that we have not been able to mention.
Introduction | |
Part I | |
1. |
What is Combinatorial Representation Theory?
What is representation theory? Main questions in representation theory Answers should be of the form |
2. | Answers for the symmetric group |
3. | Answers for the general linear group |
4. | Answers for finite dimensional complex semisimple Lie algebras |
Part II | |
5. |
Generalizing the results
Definitions Notes and references for answers to the main questions |
6. |
Generalizations of results
Partial results for further generalizations |
Appendix A | |
A1. | Basic Representation Theory |
A2. | Partitions and tableaux |
A3. | The flag variety, unipotent varieties, and Springer theory for |
A4. | Polynomial and rational representations of |
A5. | Schur-Weyl duality and Young symmetrizers |
A6. | The Borel-Weil-Bott construction |
A7. | Complex semisimple Lie algebras |
A8. | Roots, weights and paths |
Appendix B | |
B1. | Coxeter groups, groups generated by reflections, and Weyl groups |
B2. | Complex reflection groups |
Partial results for | |
B3. | Hecke algebras and “Hecke algebras” of Coxeter groups |
B4. | “Hecke algebras” of the groups |
B5. | The Iwahori-Hecke algebras of type |
Partial results for | |
B6. | The Brauer algebras |
Partial results for | |
B7. | The Birman-Murakami-Wenzl algebras |
Partial results for | |
B8. | The Temperley-Lieb algebras |
Partial results for | |
B9. | Complex semisimple Lie groups |
In January 1997, during the special year in combinatorics at MSRI, at a dessert party at Hélène’s house, Gil Kalai, in his usual fashion, began asking very pointed questions about exactly what all the combinatorial representation theorists were doing their research on. After several unsuccessful attempts at giving answers that Gil would find satisfactory, it was decided that some talks should be given in order to explain to other combinatorialists what the specialty is about and what its main questions are.
In the end, Arun gave two talks at MSRI in which he tried to clear up the situation. After the talks several people suggested that it would be helpful if someone would write a survey article containing what had been covered in the two talks and including further interesting details. After some arm twisting it was agreed that Arun and Hélène would write such a paper on combinatorial representation theory. What follows is our attempt to define the field of combinatorial representation theory, describe the main results and main questions and give an update of its current status.
Of course this is wholly impossible. Everybody in the field has their own point of view and their own preferences of questions and answers. Furthermore, there is much too much material in the field to possibly collect it all in a single article (even conceptually). We therefore feel that we must stress the obvious; in this article we give a personal viewpoint on the field while remaining aware that there is much important and beautiful work that we have not been able to mention.
On the other hand, we have tried very hard to give a focused approach and to make something that will be useful to both specialists and non specialists, for understanding what we do, for learning the concepts of the field, and for tracking down history and references. We have chosen to write in an informal style in the hope that this way we can better convey the conceptual aspects of the field. Readers should keep this in mind and refer to the notes and references and the appendices when there are questions about the precision in definitions and statements of results. We have included a table of contents at the end of the paper which should help with navigation. Having made these points, and put in a lot of work, we leave it to you the reader, with the earnest hope that you find it useful.
We would like to thank the many people in residence at the special year 1996-97 in combinatorics at MSRI, for their interest, their suggestions, and for continually encouraging us to explain and write about the things that we enjoy doing. We both are extremely indebted to our graduate advisors, A. Garsia and H. Wenzl, who (already many years ago) introduced us to and taught us this wonderful field.
What do we mean by “combinatorial representation theory”? First and foremost, combinatorial representation theory is representation theory. The adjective “combinatorial” will refer to the way in which we answer representation theoretic questions. We will discuss this more fully later. For the moment let us begin with, what is representation theory?
If representation theory is a black box, or a machine, then the input is an algebra The output of the machine is information about the modules for
An algebra is a vector space over with a multiplication.
An important example is the case of the group algebra.
Define the group algebra of a group to be so that the elements of form a basis of The multiplication in the group algebra is inherited from the multiplication in the group.
We want to study the algebra via its actions on vector spaces.
An is a finite dimensional vector space over with an action.
See Appendix A1 for a complete definition. We shall use the words module and representation interchangeably. Representation theorists are always trying to break up modules into pieces.
An is indecomposable if where and are nonzero
An is irreducible or simple if it has no submodules.
In reference to modules the words “irreducible” and “simple” are used completely interchangeably.
The algebra is semisimple if for
The “non-semisimple” case, i.e. where indecomposable is not the same as irreducible, is called modular representation theory. We will not consider this case much in these notes. However, before we banish it completely let us describe the flavor of modular representation theory.
A composition series for is a sequence of submodules of such that each is simple.
The Jordan-Hölder theorem says that two different composition series of will always produce the same multiset of simple modules. Modular representation theorists are always trying to determine this multiset of composition factors of
Remarks.
(1) | We shall not make life difficult in this article but one should note that it is common to work over general fields rather than just using the field |
(2) | If one is bold one can relax things in the definition of module and let be infinite dimensional. |
(3) | Of course the definition of irreducible modules is not correct since and are always submodules of So we are ignoring these two submodules in this definition. But conceptually the definition is the right one, we want a simple module to be something that has no submodules. |
(4) | The definition of semisimple above is not a technically correct definition. Look in Appendix A1 for the proper definition. However, the power of semisimplicity is exactly that it makes all indecomposable modules irreducible. So “indecomposable = irreducible” is really the right way to think of semisimplicity. |
(5) | A good reference for the basics of representation theory is [CRe1988]. The book [Bou1958] contains a completely general and comprehensive treatment of the theory of semisimple algebras. The appendix, §A1, to this article also contains a brief (and technically correct) introduction with more specific references. |
What do we mean by this question? We would like to be able to give some kind of answers to the following more specific questions.
(a) | How do we index/count them? |
(b) | What are their dimensions? |
The dimension of a module is just its dimension as a vector space. | |
(c) | What are their characters? |
The character of a module is the function where is the trace of the linear transformation determined by the action of on More precisely, where the sum is over a basis of the module and denotes the coefficient of in when we expand in terms of the basis |
(a) | How does decompose into irreducibles? |
If we are in the semisimple case then will always be a direct sum of irreducible modules. If we group the irreducibles of the same type together we can write where the modules are the irreducible and is the number of times an irreducible of type appears as a summand in It is common to abuse notation and write | |
(b) | What is the character of |
Special modules often have particularly nice formulas describing their characters. It is important to note that having a nice character formula for does not necessarily mean that it is easy to see how decomposes into irreducibles. Thus this question really is different from the previous one. | |
(c) | How do we find interesting representations? |
Sometimes special representations turn up by themselves and other times one has to work hard to construct the right representation with the right properties. Often very interesting representations come from other fields. | |
(d) | Are they useful? |
A representation may be particularly interesting just because of its structure while other times it is a special representation that helps to prove some particularly elusive theorem. Sometimes these representations lead to a completely new understanding of previously known facts. A famous example (which unfortunately we won’t have space to discuss, see [Hum1978]) is the Verma module, which was discovered in the mid 1960s and completely changed representation theory. |
In the modular case we have the following important question in addition to those above.
(a) | What are the indecomposable representations? |
(b) | What are the structures of their composition series? |
For each indecomposable module there is a multiset of irreducibles determined by a composition series of One would like to determine this multiset.
Even better (especially for combinatorialists), the submodules of form a lattice under inclusion of submodules and one would like to understand this lattice. This lattice is always a modular lattice and we may imagine that each edge of the Hasse diagram is labeled by the simple module where and are the modules on the ends of the edge. With this point of view the various compositions series of are the maximal chains in this lattice of modules. The Jordan-Hölder theorem says that every maximal chain in the lattice of submodules of has the same multiset of labels on its edges. What modular representation theorists try to do is determine the set of labels on a maximal chain.
Remark. The abuse of notation which allows us to write has been given a formal setting which is called the Grothendieck ring. In other words, the formal object which allows us to write such identities has been defined carefully. See [Ser1977] for precise definitions of the Grothendieck ring.
Now we come to the adjective “Combinatorial.” It refers to the way in which we give the answers to the main questions of representation theory.
(a) | How do we index/count them? |
We want to answer with a bijection between | |
(b) | What are their dimensions? |
We should answer with a formula of the form | |
(c) | What are their characters? |
We want a character formula of the type where the sum runs over all in a set of nice combinatorial objects and is a weight on these objects which depends on the element where we are evaluating the character. |
We want to give constructions that have a very explicit and very combinatorial flavor. What we mean by this will be more clear from the examples, see (C1-2) of Section 2.
(a) | How does decompose into irreducibles? |
If is an interesting representation we want to determine the positive integers in the decomposition in the form In the formula for the decomposition of the sum is over all which are objects indexing the irreducible representations of | |
(b) | What is the character of |
As in the case I(c) we want a character formula of the type where the sum runs over all in some set of nice combinatorial objects and is a weight on these objects which depends on the element where we are evaluating the character. | |
(c) | How do we find interesting representations? |
It is particularly pleasing when interesting representations arise in other parts of combinatorics! One such example is a representation on the homology of the partition lattice which also, miraculously, appears as a representation on the free Lie algebra. We won’t have space to discuss this here, see the original references [Han1981],[Joy1986], [Kly1974], [Sta1982], the article [Gar1990] for some further basics, and [Bar1990] for a study of how it can be that this representation appears in two completely different places. | |
(d) | Are they useful? |
How about for solving combinatorial problems? Or making new combinatorial problems? Sometimes a representation is exactly what is most helpful for solving a combinatorial problem. One example of this is in the recent solution of the the last few plane partition conjectures. See [Sta1971], [Mac1995] I §5 Ex. 13-18, for the statement of the problem and [Kup1994,Kup1994-2,Kup1996] and [Ste1995,Ste1994-2] for the solutions. These solutions were motivated by the method of Proctor [Pro1984]. |
The main point of all this is that a combinatorialist thinks in a special way (nice objects, bijections, weighted objects, etc.) and this method of thinking should be an integral part of the form of the solution to the problem.
Most people in the field of combinatorial representation theory agree that the field begins with the fundamental results for the symmetric group Let us give the answers to the main questions for the case of The precise definitions of all the objects used below can be found in Appendix A2. As always, by a representation of the symmetric group we mean a representation of its group algebra
(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 see Appendix A2. | |
(c) | What are their characters? |
Let be the character of the irreducible representation evaluated at a permutation of cycle type Then the character is given by where the sum is over all standard tableaux of shape and where and In the formula for sw means strictly south and weakly west and ne means strictly north and weakly east. |
There are several interesting constructions of the irreducible
(i) |
via Young symmetrizers.
Let be a tableau. Let where is the sign of the permutation Then where the action of the symmetric group is by left multiplication. |
(ii) |
Young’s seminormal construction.
Let so that the vectors are a basis of The action of on is given by and In this formula There are other important constructions of the irreducible representations We do not have room to discuss these constructions here, see the Notes and References (10-12) below and A3 in the appendix. The main ones are: |
(iii) | Young’s orthonormal construction, |
(iv) | The Kazhdan-Lusztig construction, |
(v) | The Springer construction. |
(S1) | Let The module is the same as except that we only look Then where is the number of column strict fillings of of content such that the word of the filling is a lattice permutation. The positive integers are the Littlewood-Richardson coefficients. See Appendix A2. |
(S2) | Let be a partition of Let The module is the vector space where the action of on the cosets is by left multiplication. Then where This representation also occurs in the following context: where is a unipotent element of with Jordan decomposition and is the variety of Borel subgroups in containing This representation is related to the Springer construction mentioned in C(v) above. See Appendix A3 for further details. |
(S3) | If then the tensor product is defined by for all and There are positive integers such that Except for a few special cases the positive integers are still unknown. See [Rem1992] for a combinatorial description of the cases for which the coefficients are known. |
Notes and references
(1) | The bijection in (Ia), between irreducible representations and partitions, is due to Frobenius [Fro1900]. Frobenius is the founder of representation theory and the symmetric group was one of the first examples that he worked out. |
(2) | The formula in (Ib) for the dimension of as the number of standard tableaux is immediate from the work of Frobenius, but it really came into the fore from the work of Young [You1901-1952]. The “hook formula” for is due to Frame-Robinson-Thrall [FRT1954]. |
(3) | The formula for the characters of the symmetric group which is given in (Ic) is due to Fomin and Greene [FGr1998]. For them, this formula arose by application of their theory of noncommutative symmetric functions. Roichman [Roi1997] discovered this formula independently in the more general case of the Iwahori-Hecke algebra. The formula for the Iwahori-Hecke algebra is exactly the same as the formula for the case except that the 1 appearing in case 3 of the definition of should be changed to a |
(4) | There is a different and more classical formula for the characters than the formula given in (Ic) which is called the Murnaghan-Nakayama rule [Mur1937] [Nak1940]. We have described the Murnaghan-Nakayama rule in the appendix, Theorem A2.2. Once the formula in (Ic) is given it is not hard to show combinatorially that it is equivalent to the Murnaghan-Nakayama rule but if one does not know the formula it is nontrivial to guess it from the Murnaghan-Nakayama rule. |
(5) | We do not know if anyone has compared the algorithmic complexity of the formula given in (Ic) with the algorithmic complexity of the Murnaghan-Nakayama rule. One would expect that they have the same complexity: the formula above is a sum over more objects than the sum in the Murnaghan-Nakayama rule but these objects are easier to create and many of them have zero weight. |
(6) | One of the beautiful things about the formula for the character of which is given in (Ic) is that it is a sum over the same set that we have used to describe the dimension of |
(7) | The construction of by Young symmetrizers is due to Young [You1900,You1902] from 1900. It is used so often and has so many applications that it is considered classical. A review and generalization of this construction to skew shapes appears in [GWa1989]. |
(8) | The seminormal form construction of is also due to Young [You1931,You1934] although it was discovered some thirty years after the Young symmetrizer construction. |
(9) | Young’s orthonormal construction differs from the seminormal construction only by multiplication of the basis vectors by certain constants. A comprehensive treatment of all three constructions of Young is given in the book by Rutherford [Rut1948]. |
(10) | The Kazhdan-Lusztig construction uses the Iwahori-Hecke algebra in a crucial way. It is combinatorial but relies crucially on certain polynomials which seem to be impossible to compute in practice except for very small see [Bre1994] for further information. This construction has important connections to geometry and other parts of representation theory. The paper [GMa1988] and the book [Hum1990] give elementary treatments of the Kazhdan-Lusztig construction. |
(11) | Springer’s construction is a geometric construction. In this construction the irreducible module is realized as the top cohomology group of a certain variety, see [Spr1978], [CGi1997], and Appendix A3. |
(12) | There are many ways of constructing new representations from old ones. Among the common techniques are restriction, induction, and tensoring. The special representations (S1), (S2), and (S3) given above are particularly nice examples of these constructions. One should note that tensoring of representations works for group algebras (and Hopf algebras) but not for general algebras. |
The results for the general linear group are just as beautiful and just as fundamental as those for the symmetric group. The results are surprisingly similar and yet different in many crucial ways. We shall see that the results for have been generalized to a very wide class of groups whereas the results for have only been generalized successfully to groups that look very similar to symmetric groups. The representation theory of was put on a very firm footing from the fundamental work of Schur [Sch1901,Sch1927] in 1901 and 1927.
(a) | How do we index/count them? |
There is a bijection See Appendix A4 for a definition and discussion of what it means to be a polynomial representation. | |
(b) | What are their dimensions? |
The dimension of the irreducible representation is given by where is the content of the box and is the hook length at the box | |
(c) | What are their characters? |
Let be the character of the irreducible representation evaluated at an element The character is given by where the sum is over all column strict tableaux of shape filled with entries from and and are the eigenvalues of the matrix Let us not worry about the first expression in the second line at the moment. Let us only say that it is routine to rewrite it as the second expression in that line which is one of the standard expressions for the Schur function, see [Mac1995] I §3. |
There are several interesting constructions of the irreducible
(C1) | via Young symmetrizers. |
Recall that the irreducible of the symmetric group was constructed via Young symmetrizers in the form We can construct the irreducible in a similar form. If is a partition of then This important construction is detailed in Appendix A5. | |
(C2) | Gelfan’d-Tsetlin bases |
This construction of the irreducible
representations is analo-gous to the Young’s seminormal construction of the irreducible representations
of the symmetric group. Let
so that the vectors are a basis of
Define an action of symbols
on the basis vectors by
where the sum is over all column strict tableaux which are obtained from by changing a
to a and the coefficients
are given by
where is the row number of the entry where and differ and
is the position of the rightmost entry in row
of Similarly, define an action of symbols
on the basis vectors by
where the sum is over all column strict tableaux which are obtained from by changing a
to a and the coefficients
are given by
where is the row number of the entry where and differ and
is the position of the rightmost entry in row
Since generate the action of these matrices on the basis vectors will determine the action of all of on the space The action of these generators is given by: |
|
is the box where and differ,
is the row number of the box is the position of the box in its row, is the position of the rightmost entry. |
|
(C3) | The Borel-Weil-Bott construction |
Let be a partition. Then defines a character (one-dimensional representation) of the group of diagonal matrices in This character can be extended to the group of upper triangular matrices in by letting it act trivially on the group of upper unitriangular matrices in Then the fiber product is a line bundle on Finally, where is the space of global sections of the line bundle More details on the construction of the character and the line bundle are given in Appendix A6. |
(S1) |
Let
Then
where is the number of column strict fillings of
with content such that the word of the filling is a lattice permutation.
The positive integers are the Littlewood-Richardson coefficients
that appeared earlier in the decomposition of
in terms of
|
||
(S2) | Let and be irreducible polynomial representations of Then where acts on by for and Amazingly, the coefficients are the Littlewood-Richardson coefficients again. These are the same coefficients that appeared in the (S1) case above and in the (S1) case for the symmetric group. |
Remarks
(1) |
There is a strong similarity between the results for the symmetric group and the results for
One might wonder whether there is any connection between these two pictures.
There are TWO DISTINCT ways of making concrete connections between the representation theories of and the symmetric group. In fact these two are so different that DIFFERENT SYMMETRIC GROUPS are involved.
|
||||
(2) | It is important to note that the word character has two different and commonly used meanings and the use of the word character in (C3) is different than in Section 1. In (C3) above the word character means one dimensional representation. This terminology is used particularly (but not exclusively) in reference to representations of abelian groups (like the group in (C3)). In general one has to infer from the context which meaning is intended. | ||||
(3) | The indexing and the formula for the characters of the irreducible representations is due to Schur [Sch1901]. | ||||
(4) | The formula for the dimensions of the irreducibles as the number of column strict tableaux follows from the work of Kostka [Kos1882] and Schur [Sch1901]. The “hook-content” formula appears in [Mac1995] I §3 Ex. 4, where the book of Littlewood [Mac1995] is quoted. | ||||
(5) | The construction of the irreducibles by Young symmetrizers appeared in 1939 in the influential book [Wey1946] of H. Weyl. It was generalized to the symplectic and orthogonal groups by H. Weyl in the same book. Further important information about this construction in the symplectic and orthogonal cases is found in [Ber1986-2] and [KWe1993]. It is not known how to generalize this construction to arbitrary complex semisimple Lie groups. | ||||
(6) | The Gelfan’d-Tsetlin basis construction originates from 1950 [GTs1950]. A similar construction was given for the orthogonal group at the same time [GTs1950-2] and was generalized to the symplectic group by Zhelobenko, see [Zhe1987,Zeh1973]. This construction does not generalize well to other complex semisimple groups since it depends crucially on a tower of “nice” Lie groups such that all the combinatorics is controllable. | ||||
(7) | The Borel-Weil-Bott construction is not a combinatorial construction of the irreducible module It is very important because it is a construction that generalizes well to all other compact connected real Lie groups. | ||||
(8) | The facts about the special representations which we have given above are found in Littlewood’s book [Lit1940]. |
Although the foundations for generalizing the results to all complex semisimple Lie groups and Lie algebras were laid in the fundamental work of Weyl [Wey1925-26] in 1925, it is only recently that a complete generalization of the tableaux results for has been obtained by Littelmann [Lit1995]. The results which we state below are generalizations of those given for in the last section; partitions get replaced by points in a lattice called and column strict tableaux get replaced by paths. See the Appendix A7 for some basics on complex semisimple Lie algebras.
(a) | How do we index/count them? |
There is a bijection where is the cone of dominant integral weights for The set is described in Appendix A8. | |
(Ib) | What are their dimensions? |
The dimension of the irreducible representation is given by where We shall not define the operators here (or in the appendix, see [Lit1995]), let us just say that they act on paths and they are partial permutations in the sense that if acts on a path then the result is either or another path. See Appendix A8 for a few more details. | |
(c) | What are their characters? |
The character of the irreducible module is given by where is the endpoint of the path These expressions live in the group algebra of the weight lattice where is a formal variable indexed by and the multiplication is given by for See Appendix A7 for more details. |
(S1) | Let be a Levi subalgebra of (this is a Lie algebra corresponding to a subgraph of the Dynkin diagram which corresponds to The subalgebra corresponds to a subset of the set of simple roots. The restriction rule from to is where |
(S2) | The tensor product of two irreducible modules is given by where the sum is over all paths such that |
Notes and references
(1) | The indexing of irreducible representations given in (Ia) is due to Cartan and Killing, the founders of the theory, from around the turn of the century. Introductory treatments of this result can be found in [FHa1991] and [Hum1978]. |
(2) | The first equality in (Ib) is due to Littelmann [Lit1994], but his later article [Lit1995] has some improvements and can be read independently, so we recommend the later article. This formula for the dimension of the irreducible representation, the number of paths in a certain set, is exactly analogous to the formula in the case, the number of tableaux which satisfy a certain condition. The second equality is the Weyl dimension formula which was originally proved in [Wey1925-26]. It can be proved easily from the Weyl character formula given in (Ic), see [Hum1978] and [Ste1994] Lemma 2.5. This product formula is an analogue of the “hook-content” formula given in the case. |
(3) | A priori, it might be possible that the set is an infinite set, at least the way that we have defined it. In fact, this set is always finite and there is a description of the paths that are contained in it. The paths in this set are called Lakshmibai-Seshadri paths, see [Lit1995]. The explicit description of these paths is a generalization of the types of indexings that were used in the “standard monomial theory” of Lakshmibai and Seshadri [LSe1989]. |
(4) | The first equality in (Ic) is due to Littelmann [Lit1995]. This formula, a weighted sum over paths, is an analogue of the formula for the irreducible character of as a weighted sum of column strict tableaux. The second equality in (Ic) is the celebrated Weyl character formula which was originally proved in [Wey1925-26]. A modern treatment of this formula can be found in [BtD1985], [Hum1978], and [Var1984]. |
(5) | The general restriction formula (S1) is due to Littelmann [Lit1995]. This is an analogue of the rule given in (S1) of the results. In this case the formula is as a sum over paths which satisfy certain conditions whereas in the case the formula is a sum over column strict fillings which satisfy a certain condition. |
(6) | The general tensor product formula in (S2) is due to Littelmann [Lit1995]. This formula is an analogue of the formula given in (S2) of the results. |
(7) | The results of Littelmann given above are some of the most exciting results of combinatorial representation theory in recent years. They were very much inspired by some very explicit conjectures of Lakshmibai, see [LSe1989], which arose out of the “standard monomial theory” developed by Lakshmibai and Seshadri. Although Littelmann’s theory is actually much more general than we have stated above, the special set of paths used in (Ib-c) is a modified description of the same set which appeared in Lakshmibai’s conjecture. Another important influence on Littelmann in his work was Kashiwara’s work on crystal bases [Kas1990]. |
Having the above results for the symmetric group in hand we would like to try to generalize as many of the results to other similar groups and algebras as we can. Work along this line began almost immediately after the discovery of the results and it continues today. In the current state of results this has been largely
(1) | successful for the complex reflection groups and their “Hecke algebras,” |
(2) | successful for tensor power centralizer algebras and their and |
(3) | unsuccessful for general Weyl groups and finite Coxeter groups. |
The complex reflection groups
A finite Coxeter group is a finite group which is generated by reflections in In other words, take a bunch of linear transformations of which are reflections (in the sense of reflections and rotations in the orthogonal group) and see what group they generate. If the group is finite then it is a finite Coxeter group. Actually, this definition of finite Coxeter group is not the usual one (for that see Appendix B1), but since we have the following theorem we are not too far astray.
Theorem 5.1. A group is a finite group generated by reflections if and only if it is a finite Coxeter group.
The finite Coxeter groups have been classified completely and there is one group of each of the following “types” The finite crystallographic reflection groups are called Weyl groups because of their connection with Lie theory. These are the finite Coxeter groups of types
A complex reflection group is a group generated by complex reflections, i.e. invertible linear transformations of which have finite order and which have exactly one eigenvalue that is not Every finite Coxeter group is also a finite complex reflection group. The finite complex reflection groups have been classified by Shephard and Todd [STo1954] and each such group is one of the groups
(a) | where are positive integers such that divides or |
(b) | one of 34 “exceptional” finite complex reflection groups. |
The “Hecke algebras” of reflection groups
The Iwahori-Hecke algebra of a finite Coxeter group is an algebra which is a or of the group algebra See Appendix B3 for a proper definition of this algebra. It has a basis (so it is the same dimension as the group algebra of but the multiplication in this algebra depends on a particular number which can be chosen arbitrarily. These algebras are true Hecke algebras only when is a finite Weyl group.
The “Hecke algebras” of the groups are of the group algebras of the groups It is only recently (1990-1994) that they have been defined. It is important to note that these algebras are not true Hecke algebras. In group theory, a Hecke algebra is a very specific kind of double coset algebra and the “Hecke algebras” of the groups do not fit this mold. See Appendix B3-4 for the proper definition of a Hecke algebra and some discussion of how the “Hecke algebras” for the groups are defined.
A tensor power centralizer algebra is an algebra which is isomorphic to for some group (or Hopf algebra) and some representation of In this definition There are some examples of tensor power centralizer algebras that have been particularly important:
(a) | The group algebras, of the symmetric groups |
(b) | The Iwahori-Hecke algebras, of type |
(c) | The Temperley-Lieb algebras, |
(d) | The Brauer algebras, |
(e) | The Birman-Murakami-Wenzl algebras, |
(f) | The spider algebras, |
(f) | The rook monoid algebras, |
(g) | The Solomon-Iwahori algebras, |
(h) | The wall algebras, |
(i) | The algebras, |
(j) | The partition algebras. |
The spider algebras. These algebras were written down combinatorially and studied by G. Kuperberg [Kup1996-2,Kup1994-3].
The rook monoid algebras. L. Solomon (unpublished work) recognized that this very natural monoid (the combinatorics of which has also been studied in [GRe1986]) appears as a tensor power centralizer.
The Solomon-Iwahori algebras. This algebra was introduced in [Sol1990]. The fact that it is a tensor power centralizer algebra is an unpublished result of L. Solomon, see [Sol1995].
The wall algebras. These algebras were introduced in a nice combinatorial form in [BCH1994] and in other forms in [Koi1989] and Procesi [Pro1976] and other older invariant theory works [Wey1946]. All of these works were related to tensor power centralizers and/or fundamental theorems of invariant theory.
The algebras. These algebras were introduced by Kosuda and Murakami [KMu1993,KMu1992] and studied subsequently in [Led1994] and [Hal1996,Hal1995].
The partition algebras. These algebras were introduced by V. Jones in [Jon1993] and have been studied subsequently by P. Martin [Mar1996].
Some partial results giving answers to the main questions for the complex reflection groups their “Hecke algebras”, the Temperley-Lieb algebras, the Brauer algebras, and the Birman-Murakami-Wenzl algebras can be found in Appendix B. The appropriate references are as follows.
The complex reflection groups
The indexing, dimension formulas and character formulas for the representations of the groups are originally due to
Young [You1900] | for finite Coxeter groups of types and and |
Specht [Spe1932] | for the group |
Essentially what one does to determine the indexing, dimensions and the characters of the irreducible modules is to use Clifford theory to reduce the case to the case of the symmetric group Then one can use Clifford theory again to reduce the case to the case. The original reference for Clifford theory is [Cli1937] and the book by Curtis and Reiner [CRe1987] has a modern treatment. The articles [Ste1989-2] and [HRa1998] explain how the reduction from to is done. The dimension and character theory for the case has an excellent modern treatment in [Mac1995], Appendix B to Chapter I.
The construction of the irreducible representations by Young symmetrizers was extended to the finite Coxeter groups of types and by Young himself in his paper [You1929]. The authors don’t know when the general case was first treated in the literature, but it is not difficult to extend Young’s results to the general case The case does appear periodically in the literature, see for example [All1997].
Young’s seminormal construction was generalized to the “Hecke algebras” of in the work of Ariki and Koike [AKo1994] and Ariki [Ari1995]. One can easily set in the constructions of Ariki and Koike and obtain the appropriate analogues for the groups We do not know if the analogue of Young’s seminormal construction for the groups appeared in the literature previous to the work of Ariki and Koike on the “Hecke algebra” case.
The authors do not know if the analogues of the results, (S1-3) of Section 2, have explicitly appeared in the literature. It is easy to use symmetric functions and the character formulas of Specht, see [Mac1995] Chpt. I, App. B, to derive formulas for the case in terms of the symmetric group results. Then one proceeds as described above to compute the necessary formulas for in terms of the results. See [Ste1989-2] for how this is done.
The “Hecke algebras” of reflection groups
The “Hecke algebras” corresponding to the groups were defined by
Ariki and Koike [AKo1994], | for the case and |
Broué and Malle [BMa1993] and Ariki [Ari1995], | for the general case |
The results of Ariki-Koike [AKo1994] and Ariki [Ari1995] say that the “Hecke algebras” of are of the group algebras of the groups Thus, it follows from the Tits deformation theorem (see [Car1985] Chapt 10, 11.2 and [CRe1987] §68.17) that the indexings and dimension formulas for the irreducible representations of these algebras must be the same as the indexings and dimension formulas for the groups Finding analogues of the character formulas requires a bit more work and a Murnaghan-Nakayama type rule for the “Hecke algebras” of was given by Halverson and Ram [HRa1998]. As far as we know, the formula for the irreducible characters of as a weighted sum of standard tableaux which we gave in the symmetric group section has not yet been generalized to the case of and its “Hecke algebras”.
Analogues of Young’s seminormal representations have been given by
Hoefsmit [Hoe1974] and Wenzl [Wen1988], independently, for Iwahori-Hecke algebras of type
Hoefsmit [Hoe1974], for Iwahori-Hecke algebras of types and Ariki and Koike [AKo1994] for the “Hecke algebras” of and Ariki [Ari1995] for the general “Hecke algebras” of |
Gyoja [Gyo1986], for the Iwahori-Hecke algebras of type
Dipper and James [DJa1986] and Murphy [Mur1992,Mur1995] for the Iwahori-Hecke algebras of type King and Wybourne [KWy1992] and Duchamp, et al [DKL1995] for the Iwahori-Hecke algebras of type Dipper, James, and Murphy [DJa1992], [DJM1995] for the Iwahori-Hecke algebras of type Pallikaros [Pal1994], for the Iwahori-Hecke algebras of type Mathas [Mat1999] and Murphy [Mur1996], for the “Hecke algebras” of |
It follows from the Tits deformation theorem (or rather, an extension of it) that the results for the “Hecke algebras” of must be the same as for the case of the groups
The references for the combinatorial definitions of the various centralizer algebras are as follows.
Temperley-Lieb algebras. These algebras are due, independently, to many different people. Some of the discoverers were Rumer-Teller-Weyl [RTW1932], Penrose [Pen1969,Pen1971], Temperley-Lieb [TLi1971], Kaufmann [Kau1987] and Jones [Jon1983]. The work of V. Jones was crucial in making them so important in combinatorial representation theory today.
The Iwahori-Hecke algebras of type . Iwahori [Iwa1964] introduced these algebras in 1964 in connection with Jimbo [Jim1986] realized that they arise as tensor power centralizer algebras for quantum groups.
Brauer algebras. These algebras were defined by Brauer in 1937 [Bra1937]. Brauer also proved that they are tensor power centralizers.
Birman-Murakami-Wenzl algebras. These algebras are due to Birman and Wenzl [BWe1989] and Murakami [Mur1987]. It was realized early [Res1987] [Wen1990] that these arise as tensor power centralizers but there was no proof in the literature for some time. See the references in [CPr1994] §10.2.
Indexing of the representations of tensor power centralizer algebras follows from double centralizer theory (see Weyl [Wey1946]) and a good understanding of the indexings and tensor product rules for the group or algebra which it is centralizing (i.e. etc.). The references for resulting indexings and dimension formulas for the irreducible representations are as follows:
Temperley-Lieb algebras. These results are classical and can be found in the book by Goodman, de la Harpe, and Jones [GHJ1989].
Brauer algebras. These results were known to Brauer [Bra1937] and Weyl [Wey1946]. An important combinatorial point of view was given by Berele [Ber1986,Ber1986-2] and further developed by Sundaram [Sun1990,Sun1990-2,Sun1990-3].
Iwahori-Hecke algebras of type These results follow from the Tits deformation theorem and the corresponding results for the symmetric group.
Birman-Murakami-Wenzl algebras. These results follow from the Tits deformation theorem and the corresponding results for the Brauer algebra.
The indexings and dimension formulas for the Temperley-Lieb and Brauer algebras also follow easily by using the techniques of the Jones basic construction, see [Wen1988-2] and [HRa1995].
The references for the irreducible characters of the various tensor power centralizer algebras are as follows:
Temperley-Lieb algebras. Character formulas can be derived easily by using Jones Basic Construction techniques [HRa1995].
Iwahori-Hecke algebras of type The analogue of the formula for the irreducible characters of as a weighted sum of standard tableaux was found by Roichman [Roi1997]. Murnaghan-Nakayama type formulas were found by several authors [KWy1992], [vdJ1991], [VKe1989], [SUe1991], and [Ram1991-2].
Brauer algebras and Birman-Murakami-Wenzl algebras. Murnaghan-Nakayama type formulas were derived in [Ram1995] and [HRa1995], respectively.
Brauer algebra and Birman-Murakami-Wenzl algebra analogues of the formula for the irreducible characters of the symmetric groups as a weighted sum of standard tableaux have not appeared in the literature.
Temperley-Lieb algebras. An application of the Jones Basic Construction (see [Wen1988-2] and [HRa1995]) gives a construction of the irreducible representations of the Temperley-Lieb algebras. This construction is classical and has been rediscovered by many people. In this case the construction is an analogue of the Young symmetrizer construction. The analogue of the seminormal construction appears in [GHJ1989].
Iwahori-Hecke algebras of type The analogue of Young’s seminormal construction for this case is due, independently, to Hoefsmit [Hoe1974] and Wenzl [Wen1988]. Analogues of Young symmetrizers (different analogues) have been given by Gyoja [Gyo1986] and Dipper, James, and Murphy [DJa1986], [Mur1992,Mur1995], King and Wybourne [KWy1992] and Duchamp, et al. [DKL1995].
Brauer algebras. Analogues of Young’s seminormal representations have been given, independently, by Nazarov [Naz1996] and Leduc and Ram [LRa1977]. An analogue of the Young symmetrizer construction can be obtained by applying the Jones Basic Construction to the classical Young symmetrizer construction and this is the one that has been used by many authors [BBL1990], [HWa1989], [Ker1990], [GLe1996]. The actual element of the algebra which is the analogue of the Young symmetrizer involves a central idempotent for which there is no known explicit formula and this is the reason that most authors work with a quotient formulation of the appropriate module.
Birman-Murakami-Wenzl algebras. Analogues of Young’s seminormal representations have been given by Murakami [Mur1990] and Leduc and Ram [LRa1977]. The methods in the two works are different, the work of Murakami uses the physical theory of Boltzmann weights and the work of Leduc and Ram uses the theory of ribbon Hopf algebras and quantum groups. Exactly in the same way as for the Brauer algebra, an analogue of the Young symmetrizer construction can be obtained by applying the Jones Basic Construction to the Young symmetrizer constructions for the Iwahori-Hecke algebra of type As in the Brauer algebra case one should work with a quotient formulation of the module to avoid using a central idempotent for which there is no known explicit formula.
Generalizing the theory to finite Coxeter groups of exceptional type, finite complex reflection groups of exceptional type and the corresponding Iwahori-Hecke algebras, has been largely unsuccessful. This is not to say that there haven’t been some very nice partial results only that at the moment nobody has any understanding of how to make a good combinatorial theory to encompass all the classical and exceptional types at once. Two amazing partial results along these lines are The Springer construction is a construction of the irreducible representations of the crystallographic reflection groups on cohomology of unipotent varieties [Spr1978]. It is a geometric construction and not a combinatorial construction. See Appendix A3 for more information in the symmetric group case. It is possible that this construction may be combinatorialized in the future, but to date no one has done this.
The Kazhdan-Lusztig construction [KLu1979] is a construction of certain representations called cell representations and it works for all finite Coxeter groups. The cell representations are almost irreducible but unfortunately not irreducible in general, and nobody understands how to break them up into irreducibles, except in a case by case fashion. The other problem with these representations is that they depend crucially on certain polynomials, the Kazhdan-Lusztig polynomials, which seem to be impossible to compute or understand well except in very small cases, see [Bre1994] for more information. See [Car1985] for a summary and tables of the known facts about representation of finite Coxeter groups of exceptional type.
Remarks
(1) | A Hecke algebra is a specific “double coset algebra” which depends on a group and a subgroup Iwahori [Iwa1964] studied these algebras in the case that is a finite Chevalley group and is a Borel subgroup of and defined what are now called Iwahori-Hecke algebras. These are of the group algebras of finite Weyl groups. The work of Iwahori yields a presentation for these algebras which can easily be extended to define Iwahori-Hecke algebras for all Coxeter groups but, except for the original Weyl group case, these have never been realized as true Hecke algebras, i.e. double coset algebras corresponding to an appropriate and The “Hecke algebras” corresponding to the groups are of the group algebras of Although these algebras are not true Hecke algebras either, Broué and Malle [BMa1993] have shown that many of these algebras arise in connection with non-defining characteristic representations of finite Chevalley groups and Deligne-Lusztig varieties. |
(2) | There is much current research on generalizing symmetric group results to affine Coxeter groups and affine Hecke algebras. The case of affine Coxeter groups was done by Kato [Kat1983] using Clifford theory ideas. The case of affine Hecke algebras has been intensely studied by Lusztig [Lus1987, Lus1987-2, Lus1989, Lus1988, Lus1989-2, Lus1995, Lus1995-2], Kazhdan-Lusztig [KLu0862716], and Ginzburg [Gin1987], [CGi1997], but most of this work is very geometric and relies on intersection cohomology/K-theory methods. Hopefully some of their work will be made combinatorial in the near future. |
(3) | Wouldn’t it be great if we had a nice combinatorial representation theory for finite simple groups!! |
There have been successful generalizations of the results for the questions (Ia-c), (S1), (S2) to the following classes of groups and algebras.
(1) | Connected complex semisimple Lie groups. |
Examples: | |
(2) | Compact connected real Lie groups. |
Examples: where | |
(3) | Finite dimensional complex semisimple Lie algebras. |
Examples: See Appendix A7 for the complete list of the finite dimensional complex semisimple Lie algebras. | |
(4) | Quantum groups corresponding to complex semisimple Lie algebras. |
The method of generalizing the results to the objects in (1-4) is to reduce them all to case (3) and then solve case (3). The results for case (3) are given in Section 4. The reduction of cases (1) and (2) to case (3) are outlined in [Ser1987], and given in more detail in [Var1984] and [BtD1985]. The reduction of (4) to (3) is given in [CPr1994] and in [Jan1995].
Some partial results along the lines of the results (Ia-c) and (S1-2) for and complex semisimple Lie algebras have been obtained for the following groups and algebras.
(1) | Kac-Moody Lie algebras and groups |
(2) | Yangians |
(3) | Simple Lie superalgebras |
Other groups and algebras, for which the combinatorial representation theory is not understood very well, are
(4) | Finite Chevalley groups |
(5) | Chevalley groups |
(6) | Real reductive Lie groups |
(7) | The Virasoro algebra |
There are many many possible ways that we could extend this list but probably these four cases are the most fundamental cases where the combinatorial representation theory has not been formulated. There has been intense work on all of these cases, but hardly any by combinatorialists. Thus there are many beautiful results known but very few of them have been stated or interpreted through a combinatorialists eyes. The world is a gold mine, yet to be mined!
Notes and references
(1) | An introductory reference to Kac-Moody Lie algebras is [Kac1104219]. This book contains a good description of the basic representation theory of these algebras. We don’t know of a good introductory reference for the Kac-Moody groups case, we would suggest beginning with the paper [KKu0866159] and following the references there. |
(2) | The basic introductory reference for Yangians and their basic representation theory is [CPr1994], Chapter 12. See also the references given there. |
(3) | The best introductory reference for Lie superalgebras is Scheunert’s book [Sch1979]. For an update on the combinatorial representation theory of these cases see the papers [Ser1984], [BRe1987], [BSR1998], and [Ser1997]. |
(4) | Finding a general combinatorial representation theory for finite Chevalley groups has been elusive for many years. After the fundamental work of J.A. Green [Gre1955] in 1955 which established a combinatorial representation theory for there has been a concerted effort to extend these results to other finite Chevalley groups. G. Lusztig [Lus1977,Lus1977-2,Lus1984,Lus1974] has made important contributions to this field; in particular, the results of Deligne-Lusztig [DLu1976] are fundamental. However, this is a geometric approach rather than a combinatorial one and there is much work to be done for combinatorialists, even in interpreting the known results from combinatorial viewpoint. A good introductory treatment of this theory is the book by Digne and Michel [DMi1991]. The original work of Green is treated in [Mac1995] Chapt. IV. |
(5) | The representation theory of Lie groups has been studied intensely by representation theorists but essentially not at all by combinatorialists. It is clear that there is a beautiful (although possibly very difficult) combinatorial representation theory lurking here. The best introductory reference to this work is the paper of R. Howe [How1994] on Recent results of G. Lusztig [Lus1995-2] are a very important step in providing a general combinatorial representation theory for groups. |
(6) | The best place to read about the representation theory of real reductive groups is in the books of D. Vogan and N. Wallach [KVo1995], [Vog1987] , [Vog1981], [Wal1988,Wal1992]. |
(7) | The Virasoro algebra is a Lie algebra that seems to turn up in every back alley of representation theory. One can only surmise that it must have a beautiful combinatorial representation theory that is waiting to be clarified. A good place to read about the Virasoro algebra is in [FFu1990]. |
An algebra is a vector space over with a multiplication that is associative, distributive, has an identity and satisfies the following equation An is a vector space over with an which satisfies for all and We shall use the words module and representation interchangeably.
A module is indecomposable if there do not exist non zero and such that A module is irreducible or simple if the only submodules of are the zero module and itself. A module is semisimple if it is the direct sum of simple submodules.
An algebra is simple if the only ideals of are the zero ideal and itself. The radical of an algebra is the intersection of all the maximal left ideals of An algebra is semisimple if all its modules are semisimple. An algebra is Artinian if every decreasing sequence of left ideals of stabilizes, that is for every chain of left ideals of there is an integer such that for all
The following statements follow directly from the definitions.
Let be an algebra.
(a) | Every irreducible is indecomposable. |
(b) | The algebra is semisimple if and only if every indecomposable is irreducible. |
The proofs of the following statements are more involved and can be found in [Bou1958] Chpt. VIII, §6, and §5,
Theorem A1.1.
(a) | If is an Artinian algebra then the radical of is the largest nilpotent ideal of |
(b) | An algebra is semisimple if and only if is Artinian and |
(c) | Every semisimple algebra is a direct sum of simple algebras. |
The case when is not necessarily semisimple is often called modular representation theory. Let be an A composition series of is a chain such that, for each the modules are irreducible. The irreducible modules are the factors of the composition series. The following theorem is proved in [CRe1988] (13.7).
Theorem A1.2. (Jordan-Hölder) If there exists a composition series for then any two composition series must have the same multiset of factors (up to module isomorphism).
An important combinatorial point of view is as follows: The analogue of the subgroup lattice of a group can be studied for any More precisely, the submodule lattice of is the lattice defined by the submodules of with the order relations given by inclusions of submodules. The composition series are maximal chains in this lattice.
References
All of the above results can be found in [Bou1958] Chapt. VIII and [CRe1988].
Partitions
A partition is a sequence of integers such that It is conventional to identify a partition with its Ferrers diagram which has boxes in the row. For example the partition has Ferrers diagram We number the rows and columns of the Ferrers diagram as is conventionally done for matrices. If is a box in then the content and the hook length of are respectively given by
If and are partitions such that the Ferrers diagram of is contained in the Ferrers diagram of then we write and we denote the difference of the Ferrers diagrams by We refer to as a shape or, more specifically, a skew shape.
Tableaux
Suppose that has boxes. A standard tableau of shape is a filling of the Ferrers diagram of with such that the rows and columns are increasing from left to right and from top to bottom respectively. Let be a shape. A column strict tableau of shape filled with is a filling of the Ferrers diagram of with elements of the set such that the rows are weakly increasing from left to right and the columns are strictly increasing from top to bottom. The weight of a column strict tableau is the sequence of positive integers where is the number of in The word of a column strict tableau is the sequence obtained by reading the entries of from right to left in successive rows, starting with the top row. A word is a lattice permutation if for each and each the number of occurrences of the symbol in is not less than the number of occurences of in A border strip is a skew shape which is
(a) | connected (two boxes are connected if they share an edge), and |
(b) |
does not contain a block of boxes.
The weight of a border strip is given by where is the number of rows in |
(a) | is a border strip, and |
(b) |
The weight of a strip tableau of shape is
Theorem A2.2. (Murnaghan-Nakayama rule) Let and be partitions of and let denote the irreducible character of the symmetric group indexed by evaluated at a permutation of cycle type Then where the sum is over all strip tableaux of shape and is as given in (A2.1).
References
All of the above facts can be found in [Mac1995] Chapt. I. The proof of theorem (A2.2) is given in [Mac1995] Ch. I §7, Ex. 5.
Borel subgroups, Cartan subgroups, and unipotent elements
The groups are the subgroups of consisting of upper triangular, diagonal, and upper unitriangular matrices, respectively.
A Borel subgroup of is a subgroup which is conjugate to
A Cartan subgroup of is a subgroup which is conjugate to
A matrix is unipotent if it is conjugate to an upper unitriangular matrix.
The flag variety
There is a one-to-one correspondence between each of the following sets:
(1) | |
(2) | where and |
(3) |
The unipotent varieties
Given a unipotent element with Jordan blocks given by the partition of define an algebraic variety By conjugation, the structure of the subvariety of the flag variety depends only on the partition Thus is well defined, as an algebraic variety.
Springer theory
It is a deep theorem of Springer [Spr1978] (which holds in the generality of semisimple algebraic groups and their corresponding Weyl groups) that there is an action of the symmetric group on the cohomology of the variety This action can be interpreted nicely as follows. The imbedding It is a famous theorem of Borel that there is a ring isomorphism where is the ideal generated by symmetric functions without constant term. It follows that is also a quotient of From the work of Kraft [Kra1980], DeConcini and Procesi [DPr1981] and Tanisaki [Tan1982], one has that the ideal which it is necessary to quotient by in order to obtain an isomorphism can be described explicitly.
The symmetric group acts on the polynomial ring by permuting the variables. It turns out that the ideal remains invariant under this action, thus yielding a well defined action of on This action coincides with the Springer action on Hotta and Springer [HSp1977] have established that, if is a unipotent element of shape then, for every permutation where
is the sign of the permutation
is the trace of the action of on is the irreducible character of the symmetric group evaluated at and is a variant of the Kostka-Foulkes polynomial, see [Mac1995] III §7 Ex. 8, and §6. |
References
See [Mac1995] II §3 Ex. 1 for a description of the variety and its structure. The theorem of Borel stated in (A3.1) is given in [Bor0051508] and [BGG1973]. The references quoted in the text above will provide a good introduction to the Springer theory. The beautiful combinatorics of Springer theory has been studied by Barcelo [Bar1993], Garsia-Procesi [GPr1992], Lascoux [Las1989], Lusztig [LSp1983], Shoji [Sho1979], Spaltenstein [Spa1976], Weyman [Wey1989], and others.
If is a of dimension then, by choosing a basis of we can define a map where is the transformation of that is induced by the action of on Let
denote the
entry of the matrix and
denote the entry of the matrix |
The module is a polynomial representation if there are polynomials such that In other words is the same as the polynomial evaluated at the entries of the matrix
The module is a rational representation if there are rational functions (quotients of two polynomials) such that Clearly, every polynomial representation is a rational one.
The theory of rational representations of can be reduced to the theory of polynomial representations of This is accomplished as follows. The determinant det : defines a 1-dimensional (polynomial) representation of Any integral power of the determinant also determines a 1-dimensional representation of All irreducible rational representations can be constructed in the form for some and some irreducible polynomial representation of
There exist representations of which are not rational representations, for example There is no known classification of representations of which are not rational.
References
See [Ste1989] for a study of the combinatorics of the rational representations of
Let be the usual representation of on column vectors of length that is and the in appears in the entry. Then is the span of the words of length in the letters (except that the letters are separated by tensor symbols). The general linear group and the symmetric group acton by where and (We have chosen to make the a right action here, one could equally well choose the action of to be a left action but then the formula would be The following theorem is the amazing relationship between the group and the group which was discovered by Schur [Sch1901] and exploited with such success by Weyl [Wey1946].
Theorem A5.1. (Schur-Weyl duality)
(a) | The action of on generates |
(b) | The action of on generates |
This theorem has the following important corollary, which provides a intimate correspondence between the representation theory of and some of the representations of (the ones indexed by partitions of
Corollary A5.2. As bimodules where is the irreducible and is the irreducible indexed by
If is a partition of then the irreducible λ is given by where is a tableau of shape and and are as defined in Section 2, Question C.
Let and let be the subgroup of upper triangular matrices in A line bundle on is a pair where is an algebraic variety and is a map (morphism of algebraic varieties) such that the fibers of are lines and such that is a locally trivial family of lines. In this definition, fibers means the sets for and lines means one-dimensional vector spaces. For the definition of locally trivial family of lines see [Sha1996] Chapt. VI §1.2. By abuse of language, a line bundle is simply denoted by Conceptually, a line bundle on means that we are putting a one-dimensional vector space over each point in
A global section of the line bundle is a map (morphism of algebraic varieties) such that is the identity map on In other words a global section is any possible “right inverse map” to the line bundle.
Each partition determines a character (i.e. 1-dimensional representation) of the group of diagonal matrices in via Extend this character to be a character of by letting ignore the strictly upper triangular part of the matrix, that is for all Let be the fiber product i.e. the set of equivalence classes of pairs under the equivalence relation Then with the map is a line bundle on
The Borel-Weil-Bott theorem says that the irreducible representation of is where is the space of global sections of the line bundle
References
See [FHa1991] and G. Segal’s article in [CMS1995] for further information and references on this very important construction.
A finite dimensional complex semisimple Lie algebra is a finite dimensional Lie algebra over such that The following theorem classifies all finite dimensional complex semisimple Lie algebras.
Theorem A7.1
(a) | Every finite dimensional complex semisimple Lie algebra is a direct sum of complex simple Lie algebras. |
(b) | There is one complex simple Lie algebra corresponding to each of the following types |
The complex simple Lie algebras of types and are the ones of classical type and they are where is the matrix of a skew-symmetric form on a space.
Let be a complex semisimple Lie algebra. A Cartan subalgebra of is a maximal abelian subalgebra of Fix a Cartan subalgebra of If is a finite dimensional and is any linear function, define The space is the space of It is a nontrivial theorem (see [Ser1987]) that where is a in which can be identified with the which is defined below in Appendix A8. The vector space is the space of linear functions from to
Let be the group algebra of It can be given explicitly as where the are formal variables indexed by the elements of The character of a is
References
Theorem (A7.1) is due to the founders of the theory, Cartan and Killing, from the late 1800’s. The beautiful text of Serre [Ser1987] gives a review of the definitions and theory of complex semisimple Lie algebras. See [Hum1978] for further details.
To each of the “types”, etc., there is an associated hyperplane arrangement in The space has the usual Euclidean inner product For each hyperplane in the arrangement we choose two vectors orthogonal to the hyperplane and pointing in opposite directions. This set of chosen vectors is called the root system associated to There is a convention for choosing the lengths of these vectors but we shall not worry about that here.
Choose a chamber (connected component) of For each root we say that is positive if it points toward the same side of the hyperplane as is and negative if points toward the opposite side. It is standard notation to write The positive roots which are associated to hyperplanes which form the walls of are the simple roots The fundamental weights are the vectors in such that Then are the lattice of integral weights and the cone of dominant integral weights, respectively. There is a one-to-one correspondence between the irreducible representations of and the elements of the cone in the lattice
Let be a point in Then the straight line path from to is the map The set is given by where are the path operators introduced in [Lit1995]. These paths might look like They are always piecewise linear and end in a point in
References
The basics of root systems can be found in [Hum1978]. The reference for the path model of Littelmann is [Lit1995].
A Coxeter group is a group presented by generators and relations where each is either or a positive integer greater than 1.
A reflection is a linear transformation of which is a reflection in some hyperplane.
A finite group generated by reflections is a finite subgroup of 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” |
The irreducible finite Coxeter groups of classical type are the ones of types and and the others are the irreducible finite Coxeter groups of exceptional type.
(a) | The group of type is the symmetric group |
(b) | The group of type is the hyperoctahedral group the wreath product of the group of order 2 and the symmetric group It has order |
(c) | The group of type is a subgroup of index 2 in the Coxeter group of type |
(d) | The group of type is a dihedral group of order |
References
The most comprehensive reference for finite groups generated by reflections is [Bou1968]. See also the book of Humphreys [Hum1990].
A complex reflection is an invertible linear transformation of of finite order which has exactly one eigenvalue that is not 1. A complex reflection group is a group generated by complex reflections in The finite complex reflection groups have been classified by Shepard and Todd [STo1954]. Each finite complex reflection group is either
(a) | for some positive integers such that divides or |
(b) | one of 34 other “exceptional” finite complex reflection groups. |
Let and be positive integers such that The complex reflection group is the set of matrices such that
(a) | The entries are either 0 or roots of unity, |
(b) | There is exactly on nonzero entry in each row and each column, |
(c) | The power of the product for the nonzero entries is 1. |
(a) | the symmetric group or Weyl group of type , |
(b) | is the hyperoctahedral group or Weyl group of type |
(c) | the wreath product of the cyclic group of order with |
(d) | is the Weyl group of type |
Partial results for
The following are answers to the main questions (Ia-c) for the groups For the general case see [HRa1998].
(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 A standard tableau of shape is any filling of the boxes of the with the numbers such that the rows and the columns of each are increasing. | |
(c) | What are their characters? |
A Murnaghan-Nakayama type rule for the characters of the groups was originally given by Specht [Spe1932]. See also [Osi1954] and [HRa1998]. |
References
The original paper of Shepard and Todd [STo1954] remains a basic reference. Further information about these groups can be found in [HRa1998]. The articles [OSo1980], [Leh1995], [Ste1989-2], [Mal1995] contain other recent work on the combinatorics of these groups.
Let be a finite group and let be a subgroup of The Hecke algebra of the pair is the subalgebra of the group algebra of The elements as runs over a set of representatives of the double cosets form a basis of
Let be a finite Chevalley group over the field with elements and fix a Borel subgroup of The pair determines a pair where is the Weyl group of and is a set of simple reflections in (with respect to The Iwahori-Hecke algebra corresponding to is the Hecke algebra In this case the basis elements are indexed by the elements of the Weyl group corresponding to the pair and the multiplication is given by if is a simple reflection in In this formula is the length of i.e. the minimum number of factors needed to write as a product of simple reflections.
A particular example of the Iwahori-Hecke algebra occurs when and is the subgroup of upper triangular matrices. Then the Weyl group is the symmetric group and the simple reflections in the set are the transpositions In this case the algebra is the Iwahori-Hecke algebra of type and (as we will see later) can be presented by generators and relations See Section B5 for more facts about the Iwahori-Hecke algebras of type A. In particu- lar, these Iwahori-Hecke algebras also appear as tensor power centralizer algebras, see Theorem B5.3. This is some kind of miracle: the Iwahori-Hecke algebras of type A are the only Iwahori-Hecke algebras which arise naturally as tensor power centralizers.
In view of the multiplication rules for the Iwahori-Hecke algebras of Weyl groups it is easy to define a “Hecke algebra” for all Coxeter groups just by defining it to be the algebra with basis and multiplication if These algebras are not true Hecke algebras except when is a Weyl group.
References
For references on Hecke algebras see [CRe1987] (Vol I, Section 11). For references on Iwahori-Hecke algebras see [Bou1968] Chpt. IV §2 Ex. 23-25, [CRe1987]
Vol. II §
Let and be indeterminates. Let be the algebra over the field given by generators and relations
(1) | for | |
(2) | for | |
(3) | ||
(4) | ||
(5) | for |
Now suppose that and are positive integers such that Let be indeterminates, let be a primitive root of unity and specialize the variables according to the relation where the subscripts on the are taken mod The “Hecke algebra” corresponding to the group is the subalgebra of generated by the elements Upon specializing where is a primitive root of unity, becomes the group algebra Thus is a of the group algebra of the group
References
The algebras were first constructed by Ariki and Koike [AKo1994], and they were classified as cyclotomic Hecke algebras of type Bn by Broué and Malle [BMa1993] and the representation theory of was studied by Ariki [Ari1995]. See [HRa1998] for information about the characters of these algebras.
A is viewed as two rows of vertices, one above the other, and strands that connect top vertices to bottom vertices in such a way that each vertex is incident to precisely one strand. Strands cross over and under each other in three-space as they pass from one vertex to the next. We multiply and using the concatenation product given by identifying the vertices in the top row of with the corresponding vertices in the bottom row of to obtain the product
Given a permutation we will make a by tracing the edges in order from left to right across the top row. Any time an edge that we are tracing crosses an edge that has been already traced we raise the pen briefly so that the edge being traced goes under the edge which is already there. Applying this process to all of the permutations in produces a set of braids.
Fix The Iwahori-Hecke algebra of type is the span of the braids produced by tracing permutations in with multiplication determined by the braid multiplication and the following identity. This identity can be applied in any local portion of the braid.
Theorem B5.1. The algebra is the associative algebra over presented by generators and relations
The Iwahori-Hecke algebra of type is a of the group algebra of the symmetric group. If we allow ourselves to be imprecise (about the limit) we can write
Let be a power of a prime where Fq is the finite field with elements. Let be the subgroup of upper triangular matrices in and let be the trivial representation of induced to i.e. the given by where acts on the cosets by left multiplication. Using the description, see §B3, of as a double coset algebra one gets an action of on by right multiplication. This action commutes with the action.
Theorem B5.2.
(a) | The action of on generates |
(b) | The action of on generates |
This theorem gives a “duality” between and which is similar to a Schur-Weyl duality, but it differs in a crucial way: the representation is not a tensor power representation, and thus this is not yet realizing as a tensor power centralizer.
The following result gives a true analogue of the Schur-Weyl duality for the Iwahori-Hecke algebra of type it realizes as a tensor power centralizer. Assume that is not and is not a root of unity. Let be the Drinfel’d-Jimbo quantum group of type and let be the irreducible representation of with highest weight There is an action, see [CPr1994], of on which commutes with the action.
Theorem B5.3.
(a) | The action of on generates |
(b) | The action of on generates |
Theorem B5.4. The Iwahori-Hecke algebra of type is semisimple if and only if and is not a root of unity for any
Partial results for
The following results giving answers to the main questions (Ia-c) for the Iwahori-Hecke algebras of type 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 | |
(c) | What are their characters? |
For each partition of let be the character of the irreducible representation evaluated at the element where is the permutation |
References
The book [CPr1994] contains a treatment of the Schur-Weyl duality type theorem given above. See also the references there. Several basic results on the Iwahori-Hecke algebra are given in the book [GHJ1989]. The theorem giving the explicit values of such that is semisimple is due to Gyoja and Uno [GUn1989]. The character formula given above is due to Roichman [Roi1997]. See [Ram1997-2] for an elementary proof.
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]. |
A is viewed as two rows of vertices, one above the other, and strands that connect vertices in such a way that each vertex is incident to precisely one strand. Strands cross over and under each other in three-space as they pass from one vertex to the next. For example, the following are 7-tangles: We multiply and using the concatenation product given by identifying the vertices in the top row of with the corresponding vertices in the bottom row of to obtain the product tangle Then we allow the following “moves.”
Reidemeister moves II and III:
(R2) | |
(R3) |
Fix
Theorem B7.1.
Fix
The BMW-algebra is a
Theorem B7.2 (Wz3).
The Birman-Murakami-Wenzl algebra is semisimple if
Partial results for
The following results hold when
(a) | How do we index/count them? |
There is a bijection
|
|
(b) | What are their dimensions? |
The dimension of the irreducible representation |
|
(c) | What are their characters? |
A Murnaghan-Nakayama rule for the irreducible characters of the BMW-algebras was given in [HRa1995]. |
References
(1) | The Birman-Murakami-Wenzl algebra was defined independently by Birman and Wenzl in [BWe1989] and by Murakami in [Mur1987]. See [CPr1994] for references to the analogue of Schur-Weyl duality for the BMW-algebras. The articles [HRa1995], [LRa1977], [Mur1990], [Rem1992], and [Wen1990] contain further important information about the BMW-algebras. |
(2) | Although the tangle description of the BMW algebra was always in everybody’s minds it was Kaufmann that really made it precise see [Kau1990]. |
A
Theorem B8.1.
The Temperley-Lieb algebra
Theorem B8.2.
Let
The Schur Weyl duality theorem for
Theorem B8.3.
(a) |
The action of |
(b) |
The action of |
Theorem B8.4.
The Temperley-Lieb algebra is semisimple if and only if
Partial results for
The following results giving answers to the main questions (Ia-c) for the Temperley-Lieb algebras hold when
(a) | How do we index/count them? |
How do we index/count them?
|
|
(b) | What are their dimensions? |
The dimension of the irreducible representation |
|
(c) | What are their characters? |
The character of the irreducible representation
|
References
The book [GHJ1989] contains a comprehensive treatment of the basic results on the Temperley-Lieb algebra. The Schur-Weyl duality theorem is treated in the book [CPr1994], see also the references there. The character formula given above is derived in [HRa1995].
We shall not define Lie groups and Lie algebras let us only recall that a complex Lie group is a differential
If
A complex semisimple Lie group is a connected complex Lie group
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..