This book describes the basic algorithmic ideas behind accepted methods for computing with finitely presented groups.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
"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
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
EUR 10,36 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costiEUR 10,35 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costiDa: Anybook.com, Lincoln, Regno Unito
Condizione: 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. Codice articolo 9909167
Quantità: 1 disponibili
Da: Imaginal Books, Sardent, Francia
Hardcover. Condizione: Very Good. Condizione sovraccoperta: Very Good. 1st Edition. Codice articolo 000233
Quantità: 1 disponibili
Da: Moe's Books, Berkeley, CA, U.S.A.
Hard cover. Condizione: Very good. Condizione sovraccoperta: 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. Codice articolo 1141617
Quantità: 1 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9780521432139_new
Quantità: Più di 20 disponibili
Da: moluna, Greven, Germania
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 fin. Codice articolo 446935335
Quantità: Più di 20 disponibili
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9780521432139
Quantità: Più di 20 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Hardcover. Condizione: Brand New. 604 pages. 9.75x6.50x1.50 inches. In Stock. This item is printed on demand. Codice articolo __0521432138
Quantità: 1 disponibili
Da: AussieBookSeller, Truganina, VIC, Australia
Hardcover. Condizione: 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. Codice articolo 9780521432139
Quantità: 1 disponibili
Da: CitiRetail, Stevenage, Regno Unito
Hardcover. Condizione: 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. Codice articolo 9780521432139
Quantità: 1 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Buch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book describes the basic algorithmic ideas behind accepted methods for computing with finitely presented groups. Codice articolo 9780521432139
Quantità: 1 disponibili