Skip to Main Content

Proceedings of the American Mathematical Society

Published by the American Mathematical Society since 1950, Proceedings of the American Mathematical Society is devoted to shorter research articles in all areas of pure and applied mathematics.

ISSN 1088-6826 (online) ISSN 0002-9939 (print)

The 2020 MCQ for Proceedings of the American Mathematical Society is 0.85.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

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

by K. J. Horadam PDF
Proc. Amer. Math. Soc. 87 (1983), 379-385 Request permission

Abstract:

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 conjugacy problem is solvable for recursively presented graph products with cyclic edge groups over finite graphs if the vertex groups have solvable conjugacy problem and the sets of cyclic generators in them are semicritical. For graph products over infinite graphs these conditions are insufficient: a further condition ensures that graph products over infinite graphs of bounded path length have solvable conjugacy problem. These results generalise the known ones for HNN groups and free products with amalgamation.
References
Similar Articles
  • Retrieve articles in Proceedings of the American Mathematical Society with MSC: 20F10, 20L10
  • Retrieve articles in all journals with MSC: 20F10, 20L10
Additional Information
  • © Copyright 1983 American Mathematical Society
  • Journal: Proc. Amer. Math. Soc. 87 (1983), 379-385
  • MSC: Primary 20F10; Secondary 20L10
  • DOI: https://doi.org/10.1090/S0002-9939-1983-0684622-9
  • MathSciNet review: 684622