๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

SL(2) Representations of Finitely Presented Groups

โœ Scribed by Gregory W. Brumfiel, H. M. Hilden (ed.)


Publisher
Amer Mathematical Society
Year
1995
Tongue
English
Leaves
208
Series
Contemporary Mathematics 187
Edition
First Edition
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


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 of three dimensional manifolds, representations of infinite groups, and invariant theory. It features: a new finitely computable invariant $H[\pi]$ associated to groups and used to study the $SL(2)$ representations of $\pi$; and, invariant theory and knot theory related through $SL(2)$ representations of knot groups


๐Ÿ“œ SIMILAR VOLUMES


SL(2) Representations of Finitely Presen
โœ 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

Computation with finitely presented grou
โœ 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
โœ 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