Computation with Finitely Presented Groups

Computation with Finitely Presented Groups

by Charles C. Sims
ISBN-10:
0521135079
ISBN-13:
9780521135078
Pub. Date:
03/11/2010
Publisher:
Cambridge University Press
ISBN-10:
0521135079
ISBN-13:
9780521135078
Pub. Date:
03/11/2010
Publisher:
Cambridge University Press
Computation with Finitely Presented Groups

Computation with Finitely Presented Groups

by Charles C. Sims
$85.99
Current price is , Original price is $85.99. You
$85.99 
  • SHIP THIS ITEM
    Qualifies for Free Shipping
  • PICK UP IN STORE
    Check Availability at Nearby Stores

Overview

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.

Product Details

ISBN-13: 9780521135078
Publisher: Cambridge University Press
Publication date: 03/11/2010
Series: Encyclopedia of Mathematics and its Applications , #48
Pages: 624
Product dimensions: 6.10(w) x 9.10(h) x 1.40(d)

Table of Contents

1. Basic concepts; 2. Rewriting systems; 3. Automata and rational languages; 4. Subgroups of free products of cyclic groups; 5. Coset enumeration; 6. The Reidemeister-Schreier procedure; 7. Generalized automata; 8. Abelian groups; 9. Polycyclic groups; 10. Module bases; 11. Quotient groups.
From the B&N Reads Blog

Customer Reviews