Computation with Finitely Presented Groups (Encyclopedia of Mathematics and its Applications)

Sims, Charles C.

ISBN 10: 0521432138 / ISBN 13: 9780521432139

Published by Cambridge University Press, 1994

About this Item

Like New.

Seller Inventory # D7F7-3-M-0521432138-6

Bibliographic Details

• Title: Computation with Finitely Presented Groups (Encyclopedia of Mathematics and its Applications)
• Publisher: Cambridge University Press
• Publication Date: 1994
• Language: English
• ISBN 10: 0521432138
• ISBN 13: 9780521432139
• Binding: Hardcover
• Condition: Like New
• Book Type: book

About this title

Synopsis

Research in computational group theory, an active subfield of computational algebra, has emphasised three areas: finite permutation groups, finite solvable groups, and finitely presented groups. This book deals with the third of these areas. The author emphasises the connections with fundamental algorithms from theoretical computer science, particularly the theory of automata and formal languages, computational number theory, and computational commutative algebra. The LLL lattice reduction algorithm and various algorithms for Hermite and Smith normal forms from computational number theory are used to study the abelian quotients of a finitely presented group. The work of Baumslag, Cannonito and Miller on computing nonabelian polycyclic quotients is described as a generalisation of Buchberger's Gröbner basis methods to right ideals in the integral group ring of a polycyclic group. Researchers in computational group theory, mathematicians interested in finitely presented groups and theoretical computer scientists will find this book useful.

Review

"this book is a very interesting treatment of the computational aspects of combinatorial group theory. It is well-written, nicely illustrating the algorithms presented with many examples. Also, some remarks on the history of the field are included. In adition, many exercises are provided throughout...this is a very valuable book that is well-suited as a textbook for a graduate course on computational group theory. It addresses students of mahtematics and of computer science alike, providing the necessary background for both. In addition, this book will be of good use as a reference source for computational aspects of combinatorial group theory." Friedrich Otto, Mathematical Reviews