A Finite Soluble Quotient Algorithm
classification
🧮 math.GR
keywords
algorithmfinitesolubleaspectscomputingconjugatedescribeddiscussed
read the original abstract
An algorithm for computing power conjugate presentations for finite soluble quotients of predetermined structure of finitely presented groups is described. Practical aspects of an implementation are discussed.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.