The conjugacy problem for finite graph products
HTML articles powered by AMS MathViewer
- by K. J. Horadam PDF
- Proc. Amer. Math. Soc. 106 (1989), 589-592 Request permission
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
- K. J. Horadam, The conjugacy problem for graph products with central cyclic edge groups, Proc. Amer. Math. Soc. 91 (1984), no. 3, 345–350. MR 744626, DOI 10.1090/S0002-9939-1984-0744626-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
Additional Information
- © Copyright 1989 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 106 (1989), 589-592
- MSC: Primary 20F10; Secondary 05C25, 20E06, 20L10
- DOI: https://doi.org/10.1090/S0002-9939-1989-0962244-5
- MathSciNet review: 962244