Items related to Computation with Finitely Presented Groups: 48 (Encyclopedia...

Computation with Finitely Presented Groups: 48 (Encyclopedia of Mathematics and its Applications, Series Number 48) - Softcover

Book 34 of 188: Encyclopedia of Mathematics and its Applications

Sims, Charles C.

 
9780521135078: Computation with Finitely Presented Groups: 48 (Encyclopedia of Mathematics and its Applications, Series Number 48)
Softcover
ISBN 10: 0521135079 ISBN 13: 9780521135078
Publisher: Cambridge University Press, 2010

Synopsis

This book describes the basic algorithmic ideas behind accepted methods for computing with finitely presented groups.

"synopsis" may belong to another edition of this title.

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

Book Description

It is a comprehensive text presenting the fundamental algorithmic ideas which have been developed to compute with finitely presented groups, discussing techniques for computing with finitely presented groups which are infinite, or at least not obviously finite, and describing methods for working with elements, subgroups and quotient groups of a finitely presented group.

"About this title" may belong to another edition of this title.

Publisher
Cambridge University Press
Publication date
2010
Language
English
ISBN 10 
0521135079
ISBN 13 
9780521135078
Binding
Paperback
Number of pages
624