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 5,79 per la spedizione da Regno Unito a Italia
Destinazione, tempi e costiEUR 22,18 per la spedizione da U.S.A. a Italia
Destinazione, tempi e costiDa: Better World Books Ltd, Dunfermline, Regno Unito
Condizione: Very Good. Ships from the UK. Former library book; may include library markings. Used book that is in excellent condition. May show signs of wear or have minor defects. Codice articolo 52158214-20
Quantità: 1 disponibili
Da: Labyrinth Books, Princeton, NJ, U.S.A.
Condizione: New. Codice articolo 161455
Quantità: 1 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In. Codice articolo ria9780521135078_new
Quantità: Più di 20 disponibili
Da: Revaluation Books, Exeter, Regno Unito
Paperback. Condizione: Brand New. 624 pages. 9.20x6.10x1.40 inches. In Stock. This item is printed on demand. Codice articolo __0521135079
Quantità: 1 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 446927487
Quantità: Più di 20 disponibili
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Paperback / softback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 890. Codice articolo C9780521135078
Quantità: Più di 20 disponibili
Da: Chiron Media, Wallingford, Regno Unito
Paperback. Condizione: New. Codice articolo 6666-IUK-9780521135078
Quantità: 10 disponibili
Da: CitiRetail, Stevenage, Regno Unito
Paperback. Condizione: new. Paperback. 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. This book describes the basic algorithmic ideas behind accepted methods for computing with finitely presented groups. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Codice articolo 9780521135078
Quantità: 1 disponibili
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Condizione: New. Codice articolo ABLIING23Feb2215580244835
Quantità: Più di 20 disponibili
Da: AussieBookSeller, Truganina, VIC, Australia
Paperback. Condizione: new. Paperback. 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. This book describes the basic algorithmic ideas behind accepted methods for computing with finitely presented groups. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Codice articolo 9780521135078
Quantità: 1 disponibili