Computational aspects of representation theory of finite groups. II
[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].
- scientific article; zbMATH DE number 67384
- Some problems in computational representation theory
- Computational methods for representations of groups and algebras. Proceedings of the Euroconference in Essen, Germany, April 1--5, 1997
- An algorithm for constructing representations of finite groups.
- Computer condensation of modular representations
- scientific article; zbMATH DE number 4083890
- scientific article; zbMATH DE number 4103326
- Representations of groups. A computational approach.
- Tackling the generation problem in condensation.
- scientific article; zbMATH DE number 2133330
- Some problems in computational representation theory
- The computer construction of matrix representations of finite groups over finite fields
- Constructing transitive permutation groups.
- Computing the character table of a finite group.
- The 2-modular characters of the Fischer group \(Fi_{23}\).
- Book review of: K. Lux and H. Pahlings, Representations of groups. A computational approach
- Computational Approaches to Poisson Traces Associated to Finite Subgroups of
- Guide to the Atlas Software: Computational Representation Theory of Real Reductive Groups
- scientific article; zbMATH DE number 4059732 (Why is no real title available?)
- scientific article; zbMATH DE number 67384 (Why is no real title available?)
- scientific article; zbMATH DE number 194159 (Why is no real title available?)
- High performance computations in group representation theory.
- Condensation of induced representations and an application: The 2-modular decomposition numbers of Co₂
- The Computational Complexity to Evaluate Representations of General Linear Groups
- scientific article; zbMATH DE number 775176 (Why is no real title available?)
- New condensation methods with applications to the computation of Brauer character tables
- Computing with groups and their character tables
- On p-groups forming Brauer pairs.
- Tackling the generation problem in condensation.
- The 2- and 3-modular characters of the sporadic simple Fischer group \(Fi_{22}\) and its cover.
- Character tables of \(p\)-groups with derived subgroup of prime order. I.
This page was built for publication: Computational aspects of representation theory of finite groups. II
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247798)