SL(2) representations of finitely presented groups

SL(2) Representations of Finitely Presen

📁 SL(2) Representations of Finitely Presented Groups

✍ Gregory W. Brumfiel, H. M. Hilden (ed.) 📂 Library 📅 1995 🏛 Amer Mathematical Society 🌐 English

This book is essentially self-contained and requires only a basic abstract algebra course as background. The book includes and extends much of the classical theory of $SL(2)$ representations of groups. Readers will find $SL(2)$Representations of Finitely Presented Groups relevant to geometric theory

SL(2) Representations of Finitely Presen

📁 SL(2) Representations of Finitely Presented Groups (Contemporary Mathematics)

✍ Gregory W. Brumfiel, H. M. Hilden 📂 Library 📅 1995 🌐 English

SL(2) Representations of Finitely Presen

📁 SL(2) Representations of Finitely Presented Groups (Contemporary Mathematics)

✍ Gregory W. Brumfiel, H. M. Hilden 📂 Library 📅 1995 🌐 English

This book is essentially self-contained and requires only a basic abstract algebra course as background. The book includes and extends much of the classical theory of $SL(2)$ representations of groups. Readers will find $SL(2)$Representations of Finitely Presented Groups relevant to geome

Finite Presentability of S-Arithmetic Gr

📁 Finite Presentability of S-Arithmetic Groups Compact Presentability of Solvable Groups

✍ Herbert Abels (auth.) 📂 Library 📅 1987 🏛 Springer-Verlag Berlin Heidelberg 🌐 English

Computation with finitely presented grou

📁 Computation with finitely presented groups

✍ Charles C. Sims 📂 Library 📅 1994 🏛 Cambridge University Press 🌐 English

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

Computation with finitely presented grou

📁 Computation with finitely presented groups

✍ Charles C. Sims 📂 Library 📅 1994 🏛 CUP 🌐 English

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