Previous |  Up |  Next


From the text: The aim of this work is to advertise an algorithmic treatment of the computation of the cohomologies of semisimple Lie algebras. The base is Kostant's result which describes the representation of the proper reductive subalgebra on the cohomologies space. We show how to (algorithmically) compute the highest weights of irreducible components of this representation using the Dynkin diagrams. The software package $LiE$ offers the data structures and corresponding procedures for computing with semisimple Lie algebras. Thus, using $LiE$ it has been easy to implement the (theoretical) algorithm.\par The web implementation of the resulting algorithm is available online at the following address$\sim$silhan/lac. (These pages compute moreover cohomologies of real semisimple Lie algebras. These cohomologies will be described elsewhere).
Partner of
EuDML logo