Skip to main content
Free carbon-neutral shipping over $39.99  ·  Thousands of books on sale — sale ends soon

Computation with Finitely Presented Groups (Paperback)

by Charles C. Sims

Cambridge University Press

Paperback or Softback 624 pages Mar 11, 2010

(No reviews yet) Write a Review
Millions of titlesEvery book you're looking for
Carbon-neutral shippingFree on orders over $39.99
Fast shipping worldwideDelivered to your door
The book describes methods for working with elements, subgroups, and quotient groups of a finitely presented group. The author emphasizes the connection with fundamental algorithms from theoretical computer science, particularly the theory of automata and formal languages, from computational number theory, and from computational commutative algebra. The LLL lattice reduction algorithm and various algorithms for Hermite and Smith normal forms are used to study the Abelian quotients of a finitely presented group. The work of Baumslag, Cannonito, and Miller on computing non-Abelian polycyclic quotients is described as a generalization of Buchberger's Gröbner basis methods to right ideals in the integral group ring of a polycyclic group.
Author:
Charles C. Sims
Publisher:
Cambridge University Press
Publication Date:
Mar 11, 2010
Number of pages:
624 pages
Binding:
Paperback or Softback
ISBN-10:
0521135079
ISBN-13:
9780521135078