Computing modular and projective character degrees of soluble groups

DOI10.1016/S0747-7171(08)80073-9zbMath0733.20006MaRDI QIDQ810140

S. B. Conlon

Publication date: 1990

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

algorithmdegrees of irreducible charactersClifford theorygroup algebraCAYLEYfinite soluble group

Mathematics Subject Classification ID

Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Modular representations and characters (20C20) Projective representations and multipliers (20C25)

Related Items (4)

Pairs of non-isomorphic monomial groups with identical character tables ⋮ Computing the character table of a finite group. ⋮ Computing double cosets in soluble groups ⋮ Some problems in computational representation theory

Uses Software

• Cayley

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing character degrees in p-groups
• Constructing normalisers in finite soluble groups
• The composition and derived lengths of a soluble group
• Characters of groups with normal extra-special subgroups
• Calculating characters of \(p\)-groups
• Representations of symplectic groups
• The automorphism group of an extraspecial \(p\)-group
• On the Clifford collineation, transform and similarity groups. I.
• Endliche Gruppen I
• On the Character of Weil's Representation

This page was built for publication: Computing modular and projective character degrees of soluble groups