Last update: 9 April 2013
The partition algebra is the centralizer algebra of acting on the tensor product of its permutation representation The partition algebra is the centralizer algebra of the restriction of to We apply the theory of the basic construction (generalized matrix algebras) to the tower of partition algebras Our main results are:
A centerpiece of representation theory is the Schur–Weyl duality, which says that:
The decomposition in (0.1) essentially makes the study of the representations of and the study of representations of the symmetric group two sides of the same coin.
The group has interesting subgroups,
and corresponding centralizer algebras,
which are combinatorially defined in terms of the “multiplication of diagrams” (see Section 1) and which play exactly analogous “Schur–Weyl duality” roles with their corresponding subgroup of The Brauer algebras were introduced in 1937 by Brauer [Bra1937]. The partition algebras arose in the early 1990s in the work of Martin [Mar1991,Mar1994,Mar1996,Mar2000] and later, independently, in the work of Jones [Jon1993]. Martin and Jones discovered the partition algebra as a generalization of the Temperley–Lieb algebra and the Potts model in statistical mechanics. The partition algebras appear in [Mar2000] and [MRo1998], and their existence and importance were pointed out to us by Grood [Gro2006]. In this paper we follow the method of [Mar2000] and show that if the algebras are given the same stature as the algebras then well-known methods from the theory of the “basic construction” (see Section 4) allow for easy analysis of the whole tower of algebras
all at once.
Let In this paper we prove:
The primary new results in this paper are (a) and (f). There has been work towards a presentation theorem for the partition monoid by Fitzgerald and Leech [FLe1998], and it is possible that by now they have proved a similar presentation theorem. The statement in (b) has appeared implicitly and explicitly throughout the literature on the partition algebra, depending on what one considers as the definition of a “basic construction”. The treatment of this connection between the partition algebras and the basic construction is explained very nicely and thoroughly in [Mar2000]. We consider this connection an important part of the understanding of the structure of the partition algebras. The Schur–Weyl duality for the partition algebras appears in [Mar1991,Mar2000], and [MRo1998] and was one of the motivations for the introduction of these algebras in [Jon1993]. The Schur–Weyl duality for appears in [Mar2000] and [MRo1998]. Most of the previous literature (for example [Mar1996,MWo1999,MWo1998,DWa2000]) on the partition algebras has studied the structure of the partition algebras using the “Specht” modules of (d). Our point here is that their existence follows from the general theory of the basic construction. This is a special case of the fact that quasi-hereditary algebras are iterated sequences of basic constructions, as proved by Dlab and Ringel [DRi1989]. The statements about the semsimplicity of have mostly, if not completely, appeared in the work of Martin and Saleur [Mar1996,MSa1994]. The Murphy elements for the partition algebras are new. Their form was conjectured by Owens [Owe2002], who proved that the sum of the first of them is a central element in Here we prove all of Owens’ theorems and conjectures (by a different technique than he was using). We have not taken the next natural step and provided formulas for the action of the generators of the partition algebra in the “seminormal” representations. We hope that someone will do this in the near future.
The “basic construction” is a fundamental tool in the study of algebras such as the partition algebra. Of course, like any fundamental construct, it appears in the literature and is rediscovered over and over in various forms. For example, one finds this construction in Bourbaki [Bou1990, Chapter 2, Section 4.2, Remark 1], in [Bro1955,Bro1955-2], in [GHJ1989, Chapter 2], and in the wonderful paper of Dlab and Ringel [DRi1989] where it is explained that this construction is also the algebraic construct that “controls” the theory of quasi-hereditary algebras, recollement, and highest weight categories [CPS1988] and some aspects of the theory of perverse sheaves [MVi1987].
Though this paper contains new results in the study of partition algebras we have made a distinct effort to present this material in a “survey” style so that it may be accessible to non-experts and to newcomers to the field. For this reason we have included, in Sections 4 and 5, expositions, from scratch, of
Here the reader will find statements of the main theorems which are in exactly the correct form for our applications (generally difficult to find in the literature), and short slick proofs of all the results on the basic construction and on semisimple algebras that we need for the study of the partition algebras.
There are two sets of results on partition algebras that we have not had the space to treat in this paper:
The techniques in this paper apply, in exactly the same fashion, to the study of other diagram algebras; in particular, the planar partition algebras the Temperley–Lieb algebras and the Brauer algebras It was our original intent to include in this paper results (mostly known) for these algebras analogous to those which we have proved for the algebras but the restrictions of time and space have prevented this. While perusing this paper, the reader should keep in mind that the techniques we have used do apply to these other algebras.
This is an excerpt of a paper entitled Partition algebras, written by Tom Halverson (Mathematics and Computer Science, Macalester College, Saint Paul, MN 55105, United States) and Arun Ram.
This research was supported in part by National Science Foundation Grant DMS-0100975. This research was also supported in part by the National Science Foundation (DMS-0097977) and the National Security Agency (MDA904-01-1-0032).