Computing modular and projective character degrees of soluble groups
The article is about a finite soluble group G, a central cyclic subgroup Z, the quotient \(H=G/Z\), an algebraically closed field F of characteristic r, where r is a rational prime or zero. With these ingredients, the goal is the set of degrees of irreducible characters of the group algebra of G over F. The solution is given in terms of an algorithm, based, as one might expect, on the repeated application of Clifford theory. The algorithm has been implemented in the CAYLEY language. A large number of results for specific groups are given.
- Calculating characters of \(p\)-groups
- Characters of groups with normal extra-special subgroups
- Computing character degrees in p-groups
- Constructing normalisers in finite soluble groups
- Endliche Gruppen I
- scientific article; zbMATH DE number 3884354 (Why is no real title available?)
- scientific article; zbMATH DE number 3865540 (Why is no real title available?)
- scientific article; zbMATH DE number 3871623 (Why is no real title available?)
- scientific article; zbMATH DE number 3736029 (Why is no real title available?)
- scientific article; zbMATH DE number 3608274 (Why is no real title available?)
- On the Character of Weil's Representation
- On the Clifford collineation, transform and similarity groups. I.
- Representations of symplectic groups
- The automorphism group of an extraspecial \(p\)-group
- The composition and derived lengths of a soluble group
- Computing character degrees in p-groups
- Some problems in computational representation theory
- Pairs of non-isomorphic monomial groups with identical character tables
- Computing the character table of a finite group.
- scientific article; zbMATH DE number 3927176 (Why is no real title available?)
- On the characters of solvable finite groups
- Computing character degrees via a Galois connection
- Computing double cosets in soluble groups
This page was built for publication: Computing modular and projective character degrees of soluble groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810140)