The conjugacy problem for graph products with central cyclic edge groups

Author:
K. J. Horadam

Journal:
Proc. Amer. Math. Soc. **91** (1984), 345-350

MSC:
Primary 20F10; Secondary 05C25, 20E06

MathSciNet review:
744626

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

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.

**[1]**Michael Anshel,*Conjugate powers in HNN groups*, Proc. Amer. Math. Soc.**54**(1976), 19–23. MR**0393249**, 10.1090/S0002-9939-1976-0393249-4**[2]**Michael Anshel and Peter Stebe,*The solvability of the conjugacy problem for certain HNN groups*, Bull. Amer. Math. Soc.**80**(1974), 266–270. MR**0419615**, 10.1090/S0002-9904-1974-13455-5**[3]**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**, 10.1090/S0002-9939-1981-0609643-1**[4]**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**, 10.1090/S0002-9939-1983-0684622-9**[5]**R. Daniel Hurwitz,*On cyclic subgroups and the conjugacy problem*, Proc. Amer. Math. Soc.**79**(1980), no. 1, 1–8. MR**560573**, 10.1090/S0002-9939-1980-0560573-2**[6]**Leif Larsen,*The conjugacy problem and cyclic HNN constructions*, J. Austral. Math. Soc. Ser. A**23**(1977), no. 4, 385–401. MR**0480757****[7]**Seymour Lipschutz,*The conjugacy problem and cyclic amalgamations*, Bull. Amer. Math. Soc.**81**(1975), 114–116. MR**0379675**, 10.1090/S0002-9904-1975-13661-5**[8]**Charles F. Miller III,*On group-theoretic decision problems and their classification*, Princeton University Press, Princeton, N.J.; University of Tokyo Press, Tokyo, 1971. Annals of Mathematics Studies, No. 68. MR**0310044****[9]**Hartley Rogers Jr.,*Theory of recursive functions and effective computability*, McGraw-Hill Book Co., New York-Toronto, Ont.-London, 1967. MR**0224462****[10]**Jean-Pierre Serre,*Trees*, Springer-Verlag, Berlin-New York, 1980. Translated from the French by John Stillwell. MR**607504**

Retrieve articles in *Proceedings of the American Mathematical Society*
with MSC:
20F10,
05C25,
20E06

Retrieve articles in all journals with MSC: 20F10, 05C25, 20E06

Additional Information

DOI:
https://doi.org/10.1090/S0002-9939-1984-0744626-5

Keywords:
Groupoid,
graph product,
fundamental group,
graph of groups,
conjugacy problem,
HNN extension,
free product with amalgamation

Article copyright:
© Copyright 1984
American Mathematical Society