A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
The word problem and related results for graph product groups
1981
Proceedings of the American Mathematical Society
A graph product is the fundamental group of a graph of groups. Amongst the simplest examples are HNN groups and free products with amalgamation. The torsion and conjugacy theorems are proved for any group presented as a graph product. The graphs over which some graph product has a solvable word problem are characterised. Conditions are then given for the solvability of the word and order problems and also for the extended word problem for cyclic subgroups of any graph product. These results
doi:10.1090/s0002-9939-1981-0609643-1
fatcat:j3rn4plogve5jfq5kwewzbe2ha