Computation With Finitely Presented Groups (Paperback)
Charles C. Sims
Sold by Grand Eagle Retail, Mason, OH, U.S.A.
AbeBooks Seller since 12 October 2005
New - Soft cover
Condition: New
Quantity: 1 available
Add to basketSold by Grand Eagle Retail, Mason, OH, U.S.A.
AbeBooks Seller since 12 October 2005
Condition: New
Quantity: 1 available
Add to basketPaperback. 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 Grobner basis methods to right ideals in the integral group ring of a polycyclic group. This book describes the basic algorithmic ideas behind accepted methods for computing with finitely presented groups. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Seller Inventory # 9780521135078
"About this title" may belong to another edition of this title.
We guarantee the condition of every book as it¿s described on the Abebooks web sites. If you¿ve changed
your mind about a book that you¿ve ordered, please use the Ask bookseller a question link to contact us
and we¿ll respond within 2 business days.
Books ship from California and Michigan.
Orders usually ship within 2 business days. All books within the US ship free of charge. Delivery is 4-14 business days anywhere in the United States.
Books ship from California and Michigan.
If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.