Date of Award

5-2007

Degree Type

Report

Degree Name

Master of Science (MS)

Department

Mathematics and Statistics

Committee Chair(s)

Mark Fels

Committee

Mark Fels

Abstract

It is known that any finite-dimensional representation of a semi-simple Lie algebra is decomposable into a direct sum of irreducible representations. Here we prove some theoretical results that allow us to construct an efficient algorithm for computing such a decomposition for representations of s[2C and s[2R. We then implement this algorithm in a procedure for the computer algebra system Maple that will quickly and easily perform the decomposition. We also give several examples of this decomposition performed by the procedure in order to illustrate its advantages over calculations done ‘by hand'.

Included in

Mathematics Commons

Share

COinS