Combinatorics of Character Formulas for the Lie Superalgebra $\fgl(m,n).$

Details Combinatorics of Character Formulas for the Lie Superalgebra $\fgl(m,n).$ Combinatorics of Character Formulas for the Lie Superalgebra $\fgl(m,n).$

2011-04-09

arxiv.org/abs/1104.1668v1

Mathematics

Representation Theory

to appear in Transformation Groups

Scientific paper

Let $\fg$ be the Lie superalgebra $\fgl(m,n).$ Algorithms for computing the composition factors and multiplicities of Kac modules for $\fg$ were given by the second author in 1996, and by J. Brundan in 2003. We give a combinatorial proof of the equivalence between the two algorithms. The proof uses weight and cap diagrams introduced by Brundan and C. Stroppel, and cancelations between paths in a graph $\mathcal{G}$ defined using these diagrams. Each vertex of $\mathcal{G}$ corresponds to a highest weight of a finite dimensional simple module, and each edge is weighted by a nonnegative integer. If $\mathcal{E}$ is the subgraph of $\mathcal{G}$ obtained by deleting all edges of positive weight, then $\mathcal{E}$ is the graph that describes non-split extensions between simple highest weight modules. We also give a procedure for finding the composition factors of any Kac module, without cancelation. This procedure leads to a second proof of the main result.

Affiliated with

Also associated with

No associations

Rating

Combinatorics of Character Formulas for the Lie Superalgebra $\fgl(m,n).$ does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Combinatorics of Character Formulas for the Lie Superalgebra $\fgl(m,n).$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorics of Character Formulas for the Lie Superalgebra $\fgl(m,n).$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-353110