Computational methods in Lie theory. Selected papers from the workshop on computational methods in Lie theory, Essen, Germany, August 15-19, 1994 (Q1912707)

The articles of this special issue will be reviewed individually. The aim of the meeting was the presentation of recent results, algorithms and computational tools in Lie theory. Since the computational problems arising in representation theory of finite-dimensional Lie algebras and of finite groups of Lie type are very demanding, not only new algorithms have to be developed but also special computer algebra systems providing all the necessary scientific data and specific computational tools. At the meeting extensive demonstrations of such systems like LIE, SIMPLIE and CHEVIE took place. Contents: \textit{G. O. Michler}, Preface; \textit{T. Shoji}, On the computation of unipotent characters of finite classical groups; \textit{M. Geck}, \textit{G. Hiss}, \textit{F. Lübeck}, \textit{G. Malle} and \textit{G. Pfeiffer}, CHEVIE -- A system for computing and processing generic character tables; \textit{F. du Cloux}, The state of the art in the computation of Kazhdan-Lusztig polynomials; \textit{P. Fleischmann} and \textit{I. Janiszczak}, On the computation of conjugacy classes of Chevalley groups; \textit{H. Grassmann}, \textit{G.-M. Greuel}, \textit{B. Martin}, \textit{W. Neumann}, \textit{G. Pfister}, \textit{W. Pohl}, \textit{H. Schönemann} and \textit{T. Siebert}, On an implementation of standard bases and syzygies in SINGULAR.