This book describes the basic algorithmic ideas behind accepted methods for computing with finitely presented groups.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Better World Books Ltd, Dunfermline, Vereinigtes Königreich
Zustand: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. Artikel-Nr. 52158214-20
Anzahl: 1 verfügbar
Anbieter: California Books, Miami, FL, USA
Zustand: New. Artikel-Nr. I-9780521135078
Anzahl: Mehr als 20 verfügbar
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Zustand: New. Artikel-Nr. 8671007-n
Anzahl: Mehr als 20 verfügbar
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Zustand: New. In English. Artikel-Nr. ria9780521135078_new
Anzahl: Mehr als 20 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: 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. Artikel-Nr. 9780521135078
Anzahl: 1 verfügbar
Anbieter: Kennys Bookstore, Olney, MD, USA
Zustand: New. This book describes the basic algorithmic ideas behind accepted methods for computing with finitely presented groups. 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 32. Weight in Grams: 860. . 2010. paperback. . . . . Books ship from the US and Ireland. Artikel-Nr. V9780521135078
Anzahl: Mehr als 20 verfügbar
Anbieter: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irland
Zustand: New. This book describes the basic algorithmic ideas behind accepted methods for computing with finitely presented groups. 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 32. Weight in Grams: 860. . 2010. paperback. . . . . Artikel-Nr. V9780521135078
Anzahl: Mehr als 20 verfügbar
Anbieter: GreatBookPricesUK, Woodford Green, Vereinigtes Königreich
Zustand: As New. Unread book in perfect condition. Artikel-Nr. 8671007
Anzahl: Mehr als 20 verfügbar