Computation with Finitely Presented Groups

Charles C. Sims

ISBN 10: 0521432138 / ISBN 13: 9780521432139

Published by Cambridge University Press, 1994

About this Item

Druck auf Anfrage Neuware - Printed after ordering - This book describes the basic algorithmic ideas behind accepted methods for computing with finitely presented groups.

Seller Inventory # 9780521432139

Bibliographic Details

• Title: Computation with Finitely Presented Groups
• Publisher: Cambridge University Press
• Publication Date: 1994
• Language: English
• ISBN 10: 0521432138
• ISBN 13: 9780521432139
• Binding: Buch
• Condition: Neu

About this title

Synopsis

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.

Book Description

It is a comprehensive text presenting 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.