A Finite Soluble Quotient Algorithm

Alice C. Niemeyer

REVIEW

A Finite Soluble Quotient Algorithm

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1801.09268 v1 pith:TSJXBSEV submitted 2018-01-28 math.GR

Alice C. Niemeyer This is my paper · ORCID

classification math.GR

keywords algorithmfinitesolubleaspectscomputingconjugatedescribeddiscussed

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

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.

Discussion (0). Continue with ORCID to comment.

Pith tools