This book describes the basic algorithmic ideas behind accepted methods for computing with finitely presented groups.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
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ö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
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : Browsers' Bookstore, CBA, Albany, OR, Etats-Unis
hardcover. Etat : Very Good. Etat de la jaquette : very good. A nice copy. Clean text, solid binding. Very good copy in a very good dust jacket. We are a small business and are slowly adding photos and more information for this listing for our new . Please for photos. N° de réf. du vendeur mon0000191801
Quantité disponible : 1 disponible(s)
Vendeur : Better World Books, Mishawaka, IN, Etats-Unis
Etat : Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. N° de réf. du vendeur GRP91042253
Quantité disponible : 1 disponible(s)
Vendeur : Anybook.com, Lincoln, Royaume-Uni
Etat : 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. N° de réf. du vendeur 9909167
Quantité disponible : 1 disponible(s)
Vendeur : California Books, Miami, FL, Etats-Unis
Etat : New. N° de réf. du vendeur I-9780521432139
Quantité disponible : Plus de 20 disponibles
Vendeur : moluna, Greven, Allemagne
Gebunden. Etat : 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. N° de réf. du vendeur 446935335
Quantité disponible : Plus de 20 disponibles
Vendeur : CitiRetail, Stevenage, Royaume-Uni
Hardcover. Etat : 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. Presents 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. N° de réf. du vendeur 9780521432139
Quantité disponible : 1 disponible(s)
Vendeur : preigu, Osnabrück, Allemagne
Buch. Etat : Neu. Computation with Finitely Presented Groups | Charles C. Sims | Buch | Gebunden | Englisch | 2008 | Cambridge University Press | EAN 9780521432139 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand. N° de réf. du vendeur 101826869
Quantité disponible : 5 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. Print on Demand pp. 624 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. N° de réf. du vendeur 7410429
Quantité disponible : 4 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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ö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. N° de réf. du vendeur 9780521432139
Quantité disponible : 1 disponible(s)
Vendeur : Kennys Bookstore, Olney, MD, Etats-Unis
Etat : New. This book describes the basic algorithmic ideas behind accepted methods for computing with finitely presented groups. Series Editor(s): Rota, G.-C.; Doran, B.; Ismail, M.; Lam, T. Y.; Wutwak, E.; Flajolet, Philippe; Lutwak, E. Series: Encyclopedia of Mathematics and Its Applications. Num Pages: 624 pages, black & white illustrations. BIC Classification: PBG; UYA. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 33. Weight in Grams: 975. . 1994. hardcover. . . . . Books ship from the US and Ireland. N° de réf. du vendeur V9780521432139
Quantité disponible : Plus de 20 disponibles