Towards a soluble quotient algorithm

DOI10.1016/S0747-7171(87)80060-3zbMath0635.20013MaRDI QIDQ1097350

Wilhelm Plesken

Publication date: 1987

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

zbMATH Keywords

algorithmirreducible representationirreducible modulespolycyclic groupscoset enumerationfinite soluble groupReidemeister-Schreier algorithmSchreier transversalAG-presentationpolycyclic presentationsoluble quotients of finitely presented groups

Mathematics Subject Classification ID

Solvable groups, supersolvable groups (20F16) Group rings of infinite groups and their modules (group-theoretic aspects) (20C07) Generators, relations, and presentations of groups (20F05) Modular representations and characters (20C20) Software, source code, etc. for problems pertaining to group theory (20-04)

Related Items (11)

Some remarks on the computation of complements and normalizers in soluble groups ⋮ A presentation for a crossed embedding of finite solvable groups ⋮ Generating fast Fourier transforms of solvable groups ⋮ Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm ⋮ Universal covers of finite groups ⋮ A method for building permutation representations of finitely presented groups ⋮ Existence and efficient construction of fast Fourier transforms on supersolvable groups ⋮ Computing stable epimorphisms onto finite groups ⋮ Representing Subgroups of Finitely Presented Groups by Quotient Subgroups ⋮ Computing with Abelian sections of finitely presented groups ⋮ Computing subgroups by exhibition in finite solvable groups

Cites Work

• The mechanical computation of first and second cohomology groups
• Über einen Algorithmus zur Bestimmung der Raumgruppen
• A New Algorithm for Factoring Polynomials Over Finite Fields
• A computer application to finite p-groups
• Endliche Gruppen I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Towards a soluble quotient algorithm