The word problem and related results for graph product groups
Horadam, K.J. (1981) The word problem and related results for graph product groups. Proceedings of the American Mathematical Society, 82 (2). p. 157.
*No subscription required
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 generalise the known ones for HNN groups and free products with amalgamation.
|Publication Type:||Journal Article|
|Murdoch Affiliation:||School of Mathematical and Physical Sciences|
|Publisher:||American Mathematical Society|
|Copyright:||© 1981 American Mathematical Society|
|Item Control Page|