Computation with finitely presented groups
Author(s)
Bibliographic Information
Computation with finitely presented groups
(Encyclopedia of mathematics and its applications / edited by G.-C. Rota, v. 48)
Cambridge University Press, 2010
- : pbk
Available at 4 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
"This digitally printed version 2010"--T.p. verso
Originally published 1994
Bibliography: p. [581]-595
Includes index
Description and Table of Contents
Description
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 Groebner 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.
Table of Contents
- 1. Basic concepts
- 2. Rewriting systems
- 3. Automata and rational languages
- 4. Subgroups of free products of cyclic groups
- 5. Coset enumeration
- 6. The Reidemeister-Schreier procedure
- 7. Generalized automata
- 8. Abelian groups
- 9. Polycyclic groups
- 10. Module bases
- 11. Quotient groups.
by "Nielsen BookData"