Computing character degrees in p-groups

DOI10.1016/S0747-7171(86)80012-8zbMath0588.20006MaRDI QIDQ1073174

Michael C. Slattery

Publication date: 1986

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

zbMATH Keywords

irreducible characterscharacter degreesrecursive algorithmp-groupCAYLEYcentral subgroup

Mathematics Subject Classification ID

Ordinary representations and characters (20C15) Finite nilpotent groups, (p)-groups (20D15) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (9)

On the coadjoint orbits of maximal unipotent subgroups of reductive groups. ⋮ Involutions and characters of upper triangular matrix groups ⋮ Reduction for characters of finite algebra groups. ⋮ Dixon's character table algorithm revisited ⋮ Computing the character table of a finite group. ⋮ The groups of order 128 ⋮ Computing double cosets in soluble groups ⋮ Calculating characters of \(p\)-groups ⋮ Computing modular and projective character degrees of soluble groups

Cites Work

• Unnamed Item
• Unnamed Item
• High speed computation of group characters
• Sets of p-Powers as Irreducible Character Degrees

This page was built for publication: Computing character degrees in p-groups