Computation with Finitely Presented Grou

Computation with Finitely Presented Grou
719,- 719,-
Format E-Bok
Kopisperre Teknisk DRM
Filformat PDF
Utgivelsesår 1994
Forlag Cambridge University Press
Språk Engelsk
ISBN 9780511833755
Se flere detaljer  

Andre formater / språk

E-Bok Nedlastbar Engelsk

Om Computation with Finitely Presented Grou

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 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.


ARKs anbefalinger

Det finnes ingen vurderinger av dette produktet. Skriv anmeldelse


Tips en venn