Computation With Finitely Presented Groups

Klappentext This book describes the basic algorithmic ideas behind accepted methods for computing with finitely presented groups. Zusammenfassung 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. Inhaltsverzeichnis 1. Basic concepts; 2. Rewriting systems; 3. Automata and rational languages; 4. Subgroups of free products of cyclic groups; 5. Coset enumeration; 6. The Reidemeister-Schreier procedure; 7. Generalized automata; 8. Abelian groups; 9. Polycyclic groups; 10. Module bases; 11. Quotient groups.

Product details

• Authors: Charles C. Sims, Charles C. (Rutgers University Sims
• Assisted by: B. Doran (Editor), G. -C Rota (Editor)
• Publisher: Cambridge University Press ELT
• Languages: English
• Product format: Hardback
• Released: 28.01.1994
• EAN: 9780521432139
• ISBN: 978-0-521-43213-9
• No. of pages: 624
• Series: Publications of the Society fo
• Subject: Natural sciences, medicine, IT, technology > Mathematics > Arithmetic, algebra