Articles liés à Computation with Finitely Presented Groups

Computation with Finitely Presented Groups - Couverture souple

Livre 34 sur 188: Encyclopedia of Mathematics and its Applications

Sims, Charles C.

 
9780521135078: Computation with Finitely Presented Groups
Couverture souple
ISBN 10 : 0521135079 ISBN 13 : 9780521135078
Editeur : Cambridge University Press, 2010

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.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

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.

Revue de presse

"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

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.

Éditeur
Cambridge University Press
Date d'édition
2010
Langue
anglais
ISBN 10 
0521135079
ISBN 13 
9780521135078
Reliure
Broché
Nombre de pages
624
Coordonnées du fabricant
non disponible
Personne responsable
Avery
https://www.avery.fr/

chemin des peupliers 27
Dardilly
France