Normal view MARC view ISBD view

Computation With Finitely Presented Groups / Charles C Sims

By: Sims, Charles CContributor(s): Sims, Charles CMaterial type: Text

TextPublisher number: :International Book Distributors | :Flat No 17, Prakash Apartment 4405/2, 5 Ansari Road Darya Ganj New Delhi Series: Encyclopedia of mathematics and its applications, volume 48Publication details: New York : Cambridge University Press, @1994Description: xiii, 604p 24cmISBN: 9780521135078Subject(s): Mathematics | Algebra | Group theory -- Data processing | Finite groups -- Data processing | Combinatorial group theory -- Data processing | Endliche Gruppe | Mathematics -- Algebra -- Intermediate | Eindige groepen | Combinatieleer | Endliche Gruppe | Eindige groepenGenre/Form: Eindige groepen.DDC classification: 512.2 SIM

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 -- Appendix: Implementation issues.

Summary: 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 text to present the fundamental algorithmic ideas which have been developed to compute with finitely presented groups that

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 2 )
Comments ( 0 )

Holdings
Item type	Current library	Call number	Status	Notes	Date due	Barcode	Item holds
Books	SNU LIBRARY	512.2 SIM (Browse shelf(Opens below))	Not For Loan	Books Shifted in Mathematics Dept.		28678

Total holds: 0

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.

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 text to present the fundamental algorithmic ideas which have been developed to compute with finitely presented groups that

There are no comments on this title.

to post a comment.