Let G be a finitely presented group. This paper describes the theory and practice of a method for obtaining information about the finite and abelian-by-finite quotients of G, which often allows computation about larger quotients of the group than has been possible by more traditional methods. The paper also describes the authors' software package quotpic, which provides a user-friendly implementation of the algorithms involved in this method, as part of a complete range of facilities for computing various types of quotients of finitely presented groups. (C) 1999 Academic Press
Available from British Library Document Supply Centre- DSC:D183967 / BLDSC - British Library Documen...
Our main objective is to show that the computational methods, developed previously to search for dif...
Many group-theoretic properties from elementary abstract algebra lend themselves to simple, easily a...
Let G be a finitely presented group. This paper describes the theory and practice of a method for o...
AbstractLetGbe a finitely presented group. This paper describes the theory and practice of a method ...
AbstractLetGbe a finitely presented group. This paper describes the theory and practice of a method ...
This book describes the basic algorithmic ideas behind accepted methods for computing with finitely ...
Abstract. We present an algorithm that computes the structure of a finite abelian group G from a gen...
We present polynomial-time algorithms for computation in quotient groups G=K of a permutation group...
AbstractAn algorithm for computing power conjugate presentations for finite soluble quotients of pre...
We describe an algorithm which may be used to compute a finite presentation of a finitely generated ...
Computational group theory deals with the design, analysis and computer implementation of algorithms...
AbstractSelf-similar groups provide a rich source of groups with interesting properties; e.g., infin...
The study of finite groups has been the subject of much research, with substantial success in the 20...
This book is a blend of recent developments in theoretical and computational aspects of group theory...
Available from British Library Document Supply Centre- DSC:D183967 / BLDSC - British Library Documen...
Our main objective is to show that the computational methods, developed previously to search for dif...
Many group-theoretic properties from elementary abstract algebra lend themselves to simple, easily a...
Let G be a finitely presented group. This paper describes the theory and practice of a method for o...
AbstractLetGbe a finitely presented group. This paper describes the theory and practice of a method ...
AbstractLetGbe a finitely presented group. This paper describes the theory and practice of a method ...
This book describes the basic algorithmic ideas behind accepted methods for computing with finitely ...
Abstract. We present an algorithm that computes the structure of a finite abelian group G from a gen...
We present polynomial-time algorithms for computation in quotient groups G=K of a permutation group...
AbstractAn algorithm for computing power conjugate presentations for finite soluble quotients of pre...
We describe an algorithm which may be used to compute a finite presentation of a finitely generated ...
Computational group theory deals with the design, analysis and computer implementation of algorithms...
AbstractSelf-similar groups provide a rich source of groups with interesting properties; e.g., infin...
The study of finite groups has been the subject of much research, with substantial success in the 20...
This book is a blend of recent developments in theoretical and computational aspects of group theory...
Available from British Library Document Supply Centre- DSC:D183967 / BLDSC - British Library Documen...
Our main objective is to show that the computational methods, developed previously to search for dif...
Many group-theoretic properties from elementary abstract algebra lend themselves to simple, easily a...