Computation with Finitely Presented Groups
Series: Encyclopedia of Mathematics and its Applications; 48;
- Publisher's listprice GBP 161.00
-
81 482 Ft (77 602 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 16 296 Ft off)
- Discounted price 65 186 Ft (62 082 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
81 482 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Cambridge University Press
- Date of Publication 28 January 1994
- ISBN 9780521432139
- Binding Hardback
- No. of pages624 pages
- Size 241x160x33 mm
- Weight 975 g
- Language English 0
Categories
Short description:
This book describes the basic algorithmic ideas behind accepted methods for computing with finitely presented groups.
MoreLong description:
Research in computational group theory, an active subfield of computational algebra, has emphasised three areas: finite permutation groups, finite solvable groups, and finitely presented groups. This book deals with the third of these areas. The author emphasises 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 generalisation of Buchberger's Gr&&&246;bner 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.
"this book is a very interesting treatment of the computational aspects of combinatorial group theory. It is well-written, nicely illustrating the algorithms presented with many examples. Also, some remarks on the history of the field are included. In adition, many exercises are provided throughout...this is a very valuable book that is well-suited as a textbook for a graduate course on computational group theory. It addresses students of mahtematics and of computer science alike, providing the necessary background for both. In addition, this book will be of good use as a reference source for computational aspects of combinatorial group theory." Friedrich Otto, Mathematical Reviews
Table of Contents:
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.
More
