Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

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



The conjugacy problem for finite graph products

Author: K. J. Horadam
Journal: Proc. Amer. Math. Soc. 106 (1989), 589-592
MSC: Primary 20F10; Secondary 05C25, 20E06, 20L10
MathSciNet review: 962244
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: A finite graph product is the fundamental group of a finite graph of groups. Finite graph products with finite cyclic edge groups are shown to inherit a solvable conjugacy problem from their vertex groups under certain conditions, of which the most important is that all the edge group generators in each vertex group are powers of a common central element.

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

  • [1] K. J. Horadam, The conjugacy problem for graph products with central cyclic edge groups, Proc. Amer. Math. Soc. 91 (1984), 345-350. MR 744626 (85j:20031)
  • [2] C. F. Miller III, On group theoretic decision problems and their classification, Ann. of Math. Stud., no. 68, Princeton Univ. Press, Princeton, N.J., 1971. MR 0310044 (46:9147)
  • [3] H. Rogers, Jr. Theory of recursive functions and effective computability, McGraw-Hill, New York, 1968. MR 0224462 (37:61)
  • [4] J.-P. Serre, Trees (translated by J. Stillwell), Springer-Verlag, Berlin, 1980. MR 607504 (82c:20083)

Similar Articles

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

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

Additional Information

Keywords: Graph product, fundamental group, graph of groups, conjugacy problem, HNN extension, free product with amalgamation
Article copyright: © Copyright 1989 American Mathematical Society

American Mathematical Society