Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD courier 1 190 Ft Post 1 795 Ft Post 1 690 Ft Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft DPD point 990 Ft GLS courier 1 690 Ft GLS point 1 190 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Computation with Finitely Presented Groups

Name: Computation with Finitely Presented Groups
Brand: Cambridge University Press
SKU: 02030686
Price: 86858 HUF
Availability: InStock
Author: Charles C. Sims
ISBN: 9780521432139

Charles C. Sims

Language

English

Book Hardback

Libristo code: 02030686

Publishers Cambridge University Press, January 1994

Research in computational group theory, an active subfield of computational algebra, has emphasised... Full description

Libristo code: 02030686

592 b

86 858 Ft

In stock at our supplier Shipping in 9-15 days

30-day return policy

Customers also purchased

Introduzione alla psicologia V. De Blasi

Paperback

5 126 Ft

Niech pan zdejmie rękawiczki / Uparty milicjant Jerzy Edigey

Paperback

2 348 Ft

Tchao Pantin

Blu-ray

8 266 Ft

Le Magnetisme, l'Animal A l'Usage Des Gens Du Monde SANS AUTEUR

Paperback

5 946 Ft

Munduko etxerik handiena Leo Lionni

Paperback

7 696 Ft

Documents diplomatiques francais Ministère des Affaires étrangères

Hardback

43 010 Ft

Evaluation eines Ausbildungsprogramms in Chile mit oekonometrischen Methoden Jan-Henning Weilep

Paperback

14 906 Ft

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.