Computation with Finitely Presented Groups - Brossura

Sims, Charles C.

Brossura

ISBN 10: 0521135079 ISBN 13: 9780521135078

Casa editrice: Cambridge University Press, 2010

Riassunto

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

Su questo libro

Recensione

"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

Descrizione del libro

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.

Dettagli dell?edizione

• Editore: Cambridge University Press
• Data di pubblicazione: 2010
• Lingua: Inglese
• ISBN 10: 0521135079
• ISBN 13: 9780521135078
• Rilegatura: Copertina flessibile
• Numero di pagine: 624
• Contatto del produttore: non disponibile
• Persona responsabile: Avery; https://www.avery.fr/; ; chemin des peupliers 27; Dardilly; Francia