Computing modular and projective character degrees of soluble groups
DOI10.1016/S0747-7171(08)80073-9zbMATH Open0733.20006MaRDI QIDQ810140FDOQ810140
Authors: S. B. Conlon 
Publication date: 1990
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Recommendations
Modular representations and characters (20C20) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Projective representations and multipliers (20C25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Endliche Gruppen I
- Title not available (Why is that?)
- Computing character degrees in p-groups
- On the Clifford collineation, transform and similarity groups. I.
- Title not available (Why is that?)
- The automorphism group of an extraspecial \(p\)-group
- The composition and derived lengths of a soluble group
- On the Character of Weil's Representation
- Characters of groups with normal extra-special subgroups
- Representations of symplectic groups
- Constructing normalisers in finite soluble groups
- Calculating characters of \(p\)-groups
- Title not available (Why is that?)
Cited In (7)
- Computing character degrees via a Galois connection
- Computing double cosets in soluble groups
- Pairs of non-isomorphic monomial groups with identical character tables
- Computing character degrees in p-groups
- Title not available (Why is that?)
- Some problems in computational representation theory
- Computing the character table of a finite group.
Uses Software
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)
