AbstractWe describe in some detail an algorithm which is an important ingredient in the performance of programs for working with descriptions of groups of prime-power order. It is an algorithm for computing a useful power-commutator presentation for thep-covering group of a group given by a power-commutator presentation. We prove that the algorithm is correct and give some examples
Algorithms are described for the enumeration and recognition of groups whose order is a product of d...
Algorithms are described for the enumeration and recognition of groups whose order is a product of d...
We associate a weighted graph (G) to each nite simple group G of Lie type. We show that, with an exp...
AbstractWe describe in some detail an algorithm which is an important ingredient in the performance ...
The theory and implementation of an algorithm used in generating descriptions of p-groups aredescrib...
This is the first of three volumes on finite p-group theory. It presents the state of the art and in...
The theory and implementation of an algorithm used in generating descriptions of p-groups aredescrib...
A central problem in computational group theory is that of getting the table of ordinary characters ...
We show how automorphisms can be used to reduce significantly the resources needed to enforce laws i...
A central problem in computational group theory is that of getting the table of ordinary characters ...
We describe an algorithm which may be used to compute a finite presentation of a finitely generated ...
In this paper we take a significant step forward in the classification of 3-groups of coclass 2. Sev...
A complete group presentation consists of a set of generators and a set of replacement rules generat...
We determine product presentations for the nilpotent Lie rings with order p7 where p ≥ 7 is prime, a...
AbstractAn algorithm for computing power conjugate presentations for finite soluble quotients of pre...
Algorithms are described for the enumeration and recognition of groups whose order is a product of d...
Algorithms are described for the enumeration and recognition of groups whose order is a product of d...
We associate a weighted graph (G) to each nite simple group G of Lie type. We show that, with an exp...
AbstractWe describe in some detail an algorithm which is an important ingredient in the performance ...
The theory and implementation of an algorithm used in generating descriptions of p-groups aredescrib...
This is the first of three volumes on finite p-group theory. It presents the state of the art and in...
The theory and implementation of an algorithm used in generating descriptions of p-groups aredescrib...
A central problem in computational group theory is that of getting the table of ordinary characters ...
We show how automorphisms can be used to reduce significantly the resources needed to enforce laws i...
A central problem in computational group theory is that of getting the table of ordinary characters ...
We describe an algorithm which may be used to compute a finite presentation of a finitely generated ...
In this paper we take a significant step forward in the classification of 3-groups of coclass 2. Sev...
A complete group presentation consists of a set of generators and a set of replacement rules generat...
We determine product presentations for the nilpotent Lie rings with order p7 where p ≥ 7 is prime, a...
AbstractAn algorithm for computing power conjugate presentations for finite soluble quotients of pre...
Algorithms are described for the enumeration and recognition of groups whose order is a product of d...
Algorithms are described for the enumeration and recognition of groups whose order is a product of d...
We associate a weighted graph (G) to each nite simple group G of Lie type. We show that, with an exp...
DOI
Add to ORKG