Abstract.Finite graph products of groups with solvable conjugacy problem and infinite cyclic edge groups are considered. It is shown that the graph product has solvable conjugacy problem if the images of the edge group generators in each vertex group Gv are powers of a common central element c , where the group generated by c has solvable generalized word problem in Gv .
Abstract.In this paper, we consider the conjugacy problem for HNNextensions of groups with solvable conjugacy problem for which the associated subgroups are cyclic. An example of such a group with unsolvable conjugacy problem is constructed. A similar construction is given for free products with amalgamation.
Finite graph products of groups with solvable conjugacy problem and infinite cyclic edge groups are considered. It is shown that the graph product has solvable conjugacy problem if the images of the edge group generators in each vertex group Gv are powers of a common central element c , where the group generated by c has solvable generalized word problem in Gv. recursive monomorphisms Ae : Ge-> Gse and Be: Ge-► Gte and Ae = Be.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.