The conjugacy problem for graph products with central cyclic edge groups

Horadam, K. J.

doi:10.1090/S0002-9939-1984-0744626-5

The conjugacy problem for graph products with central cyclic edge groups
HTML articles powered by AMS MathViewer

by K. J. Horadam PDF

Proc. Amer. Math. Soc. 91 (1984), 345-350 Request permission

Abstract:

A graph product is the fundamental group of a graph of groups. Amongst the simplest examples are HNN extensions and free products with amalgamation. Graph products with cyclic edge groups inherit a solvable conjugacy problem from their vertex groups under certain conditions, the most important of which imposed here is that all the edge group generators in each vertex group are powers of a common central element. Under these conditions the conjugacy problem is solvable for any two elements not both of zero reduced length in the graph product, and for arbitrary pairs of elements in HNN extensions, tree products and many graph products over finite-leaf roses. The conjugacy problem is not solvable in general for elements of zero reduced length in graph products over graphs with infinitely many circuits.

References

Michael Anshel, Conjugate powers in HNN groups, Proc. Amer. Math. Soc. 54 (1976), 19–23. MR 393249, DOI 10.1090/S0002-9939-1976-0393249-4
Michael Anshel and Peter Stebe, The solvability of the conjugacy problem for certain HNN groups, Bull. Amer. Math. Soc. 80 (1974), 266–270. MR 419615, DOI 10.1090/S0002-9904-1974-13455-5
K. J. Horadam, The word problem and related results for graph product groups, Proc. Amer. Math. Soc. 82 (1981), no. 2, 157–164. MR 609643, DOI 10.1090/S0002-9939-1981-0609643-1
K. J. Horadam, The conjugacy problem for graph products with cyclic edge groups, Proc. Amer. Math. Soc. 87 (1983), no. 3, 379–385. MR 684622, DOI 10.1090/S0002-9939-1983-0684622-9
R. Daniel Hurwitz, On cyclic subgroups and the conjugacy problem, Proc. Amer. Math. Soc. 79 (1980), no. 1, 1–8. MR 560573, DOI 10.1090/S0002-9939-1980-0560573-2
Leif Larsen, The conjugacy problem and cyclic HNN constructions, J. Austral. Math. Soc. Ser. A 23 (1977), no. 4, 385–401. MR 480757, DOI 10.1017/s1446788700019546
Seymour Lipschutz, The conjugacy problem and cyclic amalgamations, Bull. Amer. Math. Soc. 81 (1975), 114–116. MR 379675, DOI 10.1090/S0002-9904-1975-13661-5
Charles F. Miller III, On group-theoretic decision problems and their classification, Annals of Mathematics Studies, No. 68, Princeton University Press, Princeton, N.J.; University of Tokyo Press, Tokyo, 1971. MR 0310044
Hartley Rogers Jr., Theory of recursive functions and effective computability, McGraw-Hill Book Co., New York-Toronto, Ont.-London, 1967. MR 0224462
Jean-Pierre Serre, Trees, Springer-Verlag, Berlin-New York, 1980. Translated from the French by John Stillwell. MR 607504