Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

   
Mobile Device Pairing
Green Open Access
Proceedings of the American Mathematical Society
Proceedings of the American Mathematical Society
ISSN 1088-6826(online) ISSN 0002-9939(print)

 

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.


References [Enhancements On Off] (What's this?)


Similar Articles

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: http://dx.doi.org/10.1090/S0002-9939-1984-0744626-5
PII: S 0002-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