Coset enumeration

In mathematics, coset enumeration is the problem of counting the cosets of a subgroup H of a group G given in terms of a presentation. As a by…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2007

The purpose of this thesis is to construct finite groups as homomorphic images of progenitors.

2007

We give an algorithm for enumerating cosets of a group defined as a finite homomorphic image of a semi-direct product of free…

2001

Coset enumeration, based on the methods described by Todd and Coxeter, is one of the most important tools for investigating…

2001

Several researchers have worked on parallel coset enumeration strategies using shared memory. This is important not only for…

2000

Coset enumeration is one of the basic tools for investigating finitely presented groups . Many enumerations require significant…

1998

Todd and Coxeter's method for enumerating cosets of finitely generated subgroups in finitely presented groups (abbreviated by Tc…

1997

Coset enumeration is a most important procedure for investigating finitely presented groups. We present a practical parallel…

1995

The goal of this work is to overcome the learning barriers faced when first using parallelism. Currently, in order to parallelize…

1993

This thesis describes the theory of automatic coset systems. These provide a simple and economical way of describing a system of…

1971

In 1936, J. A. Todd and H. S. M. Coxeter published a paper [13] in which they described a technique for enumerating the cosets of…