Computational aspects of representation theory of finite groups. II (Q4247798)

[For part I cf. Prog. Math. 95, 37-64 (1991; Zbl 0746.20009).] This paper surveys the current situation in computational representation theory of finite groups. It is divided into four sections, on (1) ordinary character tables, (2) tables of marks, (3) Brauer character tables, and (4) module categories. The first section is mainly concerned with improved algorithms for finding the character table of a \(p\)-group, and results concerning Brauer pairs (that is, pairs of non-isomorphic groups which have the same character table). The second section lists those groups for which tables of marks have been computed. The table of marks is the next best thing to the complete subgroup lattice, and has some applications in section 3. In section 3 there is a list of references for recently completed Brauer character tables for sporadic simple groups, as well as a description of an improvement, due to C. Jansen, in the character-theoretic part of the algorithms used in these calculations. Finally in section 4 there are some important advances in calculating small algebras which are Morita equivalent to the large block algebras one wants to study. In particular, there is a criterion, which is in certain instances a practical algorithm, for determining whether the desired Morita equivalence has been achieved. Also described are several new extensions to these so-called `condensation methods', which are essential tools in calculating Brauer character tables of large simple groups. For the entire collection see [Zbl 0903.00035].