Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Computation with Finitely Presented Groups

Computation with Finitely Presented Groups

Sims, Charles C.
Charles C., Sims

Paperback

Series: Encyclopedia of Mathematics and Its Applications, Book 48

AlgebraGeneral Mathematics

ISBN10: 0521135079
ISBN13: 9780521135078
Publisher: Cambridge University Press
Published: Mar 11 2010
Pages: 624
Weight: 1.90
Height: 1.26 Width: 6.14 Depth: 9.21
Language: English
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.

1 different editions

Also available

Also in

General Mathematics

View All