Diagram groups
Author(s)
Bibliographic Information
Diagram groups
（Memoirs of the American Mathematical Society, no. 620）
American Mathematical Society, 1997
Available at / 18 libraries
-
No Libraries matched.
- Remove all filters.
Note
"November 1997, volume 130, number 620 (end of volume)"
Includes bibliographical references
Description and Table of Contents
Description
Diagram groups are groups consisting of spherical diagrams (pictures) over monoid presentations. They can be also defined as fundamental groups of the Squier complexes associated with monoid presentations. The authors show that the class of diagram groups contains some well-known groups, such as the R. Thompson group $F$. This class is closed under free products, finite direct products, and some other group-theoretical operations. The authors develop combinatorics on diagrams similar to the combinatorics on words. This helps in finding some structure and algorithmic properties of diagram groups. Some of these properties are new even for R. Thompson's group $F$. In particular, the authors describe the centralizers of elements in $F$, prove that it has solvable conjugacy problem, and more.
Table of Contents
Introduction Rewrite systems Semigroup diagrams Monoid pictures Diagram groups Squier's complexes Monoid presentations and the diagram groups Diagram groups and group theoretic constructions Diagram groups over complete presentations Finitely presented diagram groups Commutator subgroups of diagram groups Asphericity Recursive presentations of diagram groups Computational complexity of the word problem in diagram groups Combinatorics on diagrams Different types of diagrams and finitely presented simple groups Open problems.
by "Nielsen BookData"
