Some remarks on the computation of conjugacy classes of soluble groups

DOI10.1017/S0004972700004378zbMath0683.20001MaRDI QIDQ4732610

Joachim Neubüser, M. Mecky

Publication date: 1989

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

algorithm; conjugacy classes; generating sets; centralizers; solvable group; stabilizers; coset; computing time; SOGOS; Cauchy-Frobenius- Burnside lemma

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

20D10: Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks

20-04: Software, source code, etc. for problems pertaining to group theory

Related Items

An Inductive Schema for Computing Conjugacy Classes in Permutation Groups, The Solvable Primitive Permutation Groups of Degree at Most 6560, Computing double cosets in soluble groups, Algorithms for polycyclic-by-finite groups, Computing intersections and normalizers in soluble groups, Construction of classes of subgroups of small index in \(p\)-groups, Computing conjugacy classes of elements in matrix groups., Computing conjugacy class representatives in permutation groups., Some remarks on the computation of complements and normalizers in soluble groups

Uses Software

• Cayley

Cites Work

• A generalization of Burnside's combinatorial lemma