Description - Computation with Finitely Presented Groups by Charles C. Sims
Research in computational group theory, an active subfield of computational algebra, has emphasized three areas: finite permutation groups, finite solvable groups, and finitely presented groups. This book deals with the third of these areas. It is the first text to present 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. The author emphasizes 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 generalization of Buchberger's Grobner 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.
Buy Computation with Finitely Presented Groups by Charles C. Sims from Australia's Online Independent Bookstore, Boomerang Books.
(234mm x 156mm x 33mm)
Cambridge University Press
Publisher: Cambridge University Press
Country of Publication:
Other Editions - Computation with Finitely Presented Groups by Charles C. Sims
Book Reviews - Computation with Finitely Presented Groups by Charles C. Sims