Some remarks on the computation of conjugacy classes of soluble groups

DOI10.1017/S0004972700004378zbMath0683.20001MaRDI QIDQ4732610

M. Mecky, Joachim Neubüser

Publication date: 1989

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

zbMATH Keywords

algorithmconjugacy classesgenerating setscentralizerssolvable groupstabilizerscosetcomputing timeSOGOSCauchy-Frobenius- Burnside lemma

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Finite solvable groups, theory of formations, Schunck classes, Fitting classes, (pi)-length, ranks (20D10) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (10)

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

Uses Software

• Cayley

Cites Work

• A generalization of Burnside's combinatorial lemma

This page was built for publication: Some remarks on the computation of conjugacy classes of soluble groups