A Finite Soluble Quotient Algorithm
Alice C. Niemeyer
TL;DR
This paper introduces an algorithm for computing finite soluble quotients of finitely presented groups, focusing on practical implementation aspects and enabling structured analysis of such groups.
Contribution
It presents a novel algorithm for calculating power conjugate presentations of finite soluble quotients with a focus on implementation details.
Findings
Algorithm successfully computes finite soluble quotients.
Implementation details improve practical usability.
Supports structured analysis of finitely presented groups.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.