Publication date
August 1987
DOI Publisher
Published by Elsevier Ltd. ISSN
0747-7171Abstract
An algorithm is outlined to compute soluble factor groups of finitely presented groups
An algorithm is outlined to compute soluble factor groups of finitely presented groups
[EN] A remarkable result of Thompson states that a finite group is soluble if and only if all its tw...
We will prove the following result. Theorem Let G be a finite group in which every two elements gene...
AbstractThe study of localizations of groups has concentrated on group theoretic properties which ar...
Computational group theory deals with the design, analysis and computer implementation of algorithms...
An algorithm is outlined to compute soluble factor groups of finitely presented groups
There is a large collection of effective algorithms for computing information about finite soluble ...
Let H and K be arbitrary subgroups of a finite soluble group G. The purpose of this paper is todescr...
AbstractWe1999 Academic Pressintroduce three practical algorithms to construct certain finite groups...
AbstractWe prove that if a finite soluble group G can be generated by s subgroups with pairwise copr...
AbstractWe consider finite groups which have connected transversals to subgroups whose order is a pr...
Let G be a finite soluble group and r a rational prime or zero. Let Z be a central cyclicsubgroup of...
Let R be a group of prime order r that acts on the r'-group G, let RG be the semidirect product of G...
AbstractLet F be a field and G a finite extension of a torsion-free soluble group of finite rank suc...
In [1] we obtained a short proof of the theorem of Thompson that a finite group is soluble if and on...
AbstractAn algorithm for computing power conjugate presentations for finite soluble quotients of pre...
[EN] A remarkable result of Thompson states that a finite group is soluble if and only if all its tw...
We will prove the following result. Theorem Let G be a finite group in which every two elements gene...
AbstractThe study of localizations of groups has concentrated on group theoretic properties which ar...
Computational group theory deals with the design, analysis and computer implementation of algorithms...
An algorithm is outlined to compute soluble factor groups of finitely presented groups
There is a large collection of effective algorithms for computing information about finite soluble ...
Let H and K be arbitrary subgroups of a finite soluble group G. The purpose of this paper is todescr...
AbstractWe1999 Academic Pressintroduce three practical algorithms to construct certain finite groups...
AbstractWe prove that if a finite soluble group G can be generated by s subgroups with pairwise copr...
AbstractWe consider finite groups which have connected transversals to subgroups whose order is a pr...
Let G be a finite soluble group and r a rational prime or zero. Let Z be a central cyclicsubgroup of...
Let R be a group of prime order r that acts on the r'-group G, let RG be the semidirect product of G...
AbstractLet F be a field and G a finite extension of a torsion-free soluble group of finite rank suc...
In [1] we obtained a short proof of the theorem of Thompson that a finite group is soluble if and on...
AbstractAn algorithm for computing power conjugate presentations for finite soluble quotients of pre...
[EN] A remarkable result of Thompson states that a finite group is soluble if and only if all its tw...
We will prove the following result. Theorem Let G be a finite group in which every two elements gene...
AbstractThe study of localizations of groups has concentrated on group theoretic properties which ar...
Add to ORKG