Computation with Finitely Presented Groups Contributor(s): Sims, Charles C. (Author) |
|||
ISBN: 0521432138 ISBN-13: 9780521432139 Publisher: Cambridge University Press
Binding Type: Hardcover - See All Available Formats & Editions Published: January 1994 Click for more in this series: Publications of the Society for Psychological Anthropology |
Additional Information |
BISAC Categories: - Mathematics | Group Theory - Mathematics | Algebra - General |
Dewey: 512.2 |
LCCN: 92032383 |
Series: Publications of the Society for Psychological Anthropology |
Physical Information: 1.31" H x 6.14" W x 9.21" L (2.30 lbs) 624 pages |
Descriptions, Reviews, Etc. |
Publisher Description: 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. |
Customer ReviewsSubmit your own review |
To tell a friend about this book, you must Sign In First! |