Combinatorics of character formulas for the Lie superalgebra gl(m,n)

From MaRDI portal
Publication:649077




Abstract: 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 mathcalG defined using these diagrams. Each vertex of mathcalG corresponds to a highest weight of a finite dimensional simple module, and each edge is weighted by a nonnegative integer. If mathcalE is the subgraph of mathcalG obtained by deleting all edges of positive weight, then mathcalE 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.









This page was built for publication: Combinatorics of character formulas for the Lie superalgebra \(\mathfrak{gl}(m,n)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q649077)