Computation with finitely presented groups

Main
Mathematics
Computation with finitely presented...

Computation with finitely presented groups

Name: Computation with finitely presented groups
ISBN: 9780521432139

Charles C. Sims

0 / 0

0 comments

Bu kitabı nə dərəcədə bəyəndiniz?

Yüklənmiş faylın keyfiyyəti necədir?

Kitabın keyfiyyətini qiymətləndirə bilmək üçün onu yükləyin

Yüklənmiş faylların keyfiyyəti necədir?

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 Gröbner basis methods to right ideals in the integral group ring of a polycyclic group.

Kateqoriyalar:

Mathematics

İl:

1994

Nəşriyyat:

Cambridge University Press

Dil:

english

Səhifələr:

620

ISBN 10:

0521432138