Items related to Computation with Finitely Presented Groups (Encyclopedia...
Computation with Finitely Presented Groups (Encyclopedia of Mathematics and its Applications, Series Number 48) - Hardcover
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.
"synopsis" may belong to another edition of this title.
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.
Review
"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
"About this title" may belong to another edition of this title.
Search results for Computation with Finitely Presented Groups (Encyclopedia...
Stock Image
Computation With Finitely Presented Groups
Published by
Cambridge University Press, 1994
ISBN 10: 0521432138
ISBN 13: 9780521432139
Used
Hardcover
Seller: Moe's Books, Berkeley, CA, U.S.A.
Seller rating 4 out of 5 stars
Hard cover. Condition: Very good. Dust Jacket Condition: Very good. Bothe the book and jacket are in great condition with no visible flaws apart from some light handling wear. Binding is tight and inside is clean and unmarked. Seller Inventory # 1141617
Quantity: 1 available
Stock Image
Computation With Finitely Presented Groups
Published by
Cambridge University Press, 1994
ISBN 10: 0521432138
ISBN 13: 9780521432139
Used
Hardcover
Seller: Anybook.com, Lincoln, United Kingdom
Seller rating 5 out of 5 stars
Condition: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. Clean from markings. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,1050grams, ISBN:0521432138. Seller Inventory # 9909167
Quantity: 1 available
Seller Image
Computation with Finitely Presented Groups
Published by
Cambridge University Press, 1994
ISBN 10: 0521432138
ISBN 13: 9780521432139
Used
Hardcover
First Edition
Seller: Imaginal Books, Sardent, France
Seller rating 5 out of 5 stars
Hardcover. Condition: Very Good. Dust Jacket Condition: Very Good. 1st Edition. Seller Inventory # 000233
Quantity: 1 available
Stock Image
Computation with Finitely Presented Groups (Encyclopedia of Mathematics and its Applications, Series Number 48)
Published by
Cambridge University Press, 1994
ISBN 10: 0521432138
ISBN 13: 9780521432139
New
Hardcover
Seller: Best Price, Torrance, CA, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. SUPER FAST SHIPPING. Seller Inventory # 9780521432139
Quantity: 1 available
Stock Image
Computation with Finitely Presented Groups (Encyclopedia of Mathematics and its Applications, Series Number 48)
Published by
Cambridge University Press, 1994
ISBN 10: 0521432138
ISBN 13: 9780521432139
New
Hardcover
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9780521432139
Quantity: Over 20 available
Stock Image
Computation with Finitely Presented Groups (Encyclopedia of Mathematics and its Applications, Series Number 48)
Published by
Cambridge University Press, 1994
ISBN 10: 0521432138
ISBN 13: 9780521432139
New
Hardcover
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9780521432139_new
Quantity: Over 20 available
Stock Image
Computation with Finitely Presented Groups (Hardcover)
Published by
Cambridge University Press, Cambridge, 1994
ISBN 10: 0521432138
ISBN 13: 9780521432139
New
Hardcover
Seller: Grand Eagle Retail, Mason, OH, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Hardcover. Research in computational group theory, an active subfield of computational algebra, has emphasized three areas: finite permutation groups, finite solvable groups, and finitely presented groups. This book deals with the third of these areas. It is the first text to present 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. The author emphasizes 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 generalization of Buchberger's Grobner 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521432139
Quantity: 1 available
Stock Image
Computation with Finitely Presented Groups (Hardcover)
Published by
Cambridge University Press, Cambridge, 1994
ISBN 10: 0521432138
ISBN 13: 9780521432139
New
Hardcover
Seller: AussieBookSeller, Truganina, VIC, Australia
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Hardcover. Research in computational group theory, an active subfield of computational algebra, has emphasized three areas: finite permutation groups, finite solvable groups, and finitely presented groups. This book deals with the third of these areas. It is the first text to present 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. The author emphasizes 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 generalization of Buchberger's Grobner 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. 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Seller Inventory # 9780521432139
Quantity: 1 available
Stock Image
Computation with Finitely Presented Groups (Encyclopedia of Mathematics and its Applications)
Print on DemandSeller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Brand New. 604 pages. 9.75x6.50x1.50 inches. In Stock. This item is printed on demand. Seller Inventory # __0521432138
Quantity: 1 available
Stock Image
Computation with Finitely Presented Groups (Hardcover)
Published by
Cambridge University Press, Cambridge, 1994
ISBN 10: 0521432138
ISBN 13: 9780521432139
New
Hardcover
Seller: CitiRetail, Stevenage, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Hardcover. Research in computational group theory, an active subfield of computational algebra, has emphasized three areas: finite permutation groups, finite solvable groups, and finitely presented groups. This book deals with the third of these areas. It is the first text to present 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. The author emphasizes 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 generalization of Buchberger's Grobner 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. 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9780521432139
Quantity: 1 available