An extension of coset enumeration.
Harvey Campbell · container not stated · 1971
Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.
· OpenAlex · dissertation · 1971
Abstract
The purpose of this thesis is to present the exposition of a new algorithm.If we are given a group and a subgroup of finite index the algorithm determines the index.This part of the algorithm derives from the Todd-Coxeter algorithme The second function is to give a presentati on for the subgroup in terms of those ori gi nal generators of the subgroup.This part of the algorithm is similar in scope to the classical Reidemeister-Schreier technique.The thesis first gives a detailed description of the new algorithm with a worked example.Then a proof is given that the algorithm does give a presentation for the subgroup with the proof based on a proof used for the Reidemeister-Schreier algorithme An actual FORTRAN program is included which executes the algorithme The 1 ast chapter i s concerned wi th vari oUS examples.
Open the resolved locator · 10.82308/335
Metadata licence: OpenAlex metadata (CC0)