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.She assumes that if a diagram A* is reduced then Aaquot; is reduced for every n agt; 1. This fact is correct (and obvious) if A is ... A let C(A) be the minimal set of diagrams containing A and closed under cyclic shifts. Then C(A) - Uk=0Cs(A) where Co(A)anbsp;...
|Author||:||Victor Guba, Mark Sapir|
|Publisher||:||American Mathematical Soc. - 1997|