Computation with finitely presented groups /
Research in computational group theory, an active subfield of computational algebra, has emphasized four areas: finite permutation groups, finite solvable groups, matrix representations of finite groups, and finitely presented groups. This book deals with the last of these areas. It is the first tex...
| Основен автор: | Sims, Charles C. |
|---|---|
| Формат: | Електронна книга |
| Език: | English |
| Публикувано: |
Cambridge [England] ; New York :
Cambridge University Press,
1994.
|
| Серия: |
Encyclopedia of mathematics and its applications ;
volume 48. |
| Предмети: | |
| Онлайн достъп: |
http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=569332 |
| Подобни документи: |
Print version::
Computation with finitely presented groups |
Съдържание:
- 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
- Appendix: Implementation issues.