The conjugacy problem for finite graph products
K. J. Horadam
Proc. Amer. Math. Soc. 106 (1989), 589-592
Primary 20F10; Secondary 05C25, 20E06, 20L10
Full-text PDF Free Access
Similar Articles |
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.
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
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.
0310044 (46 #9147)
Rogers Jr., Theory of recursive functions and effective
computability, McGraw-Hill Book Co., New York-Toronto, Ont.-London,
0224462 (37 #61)
Serre, Trees, Springer-Verlag, Berlin-New York, 1980.
Translated from the French by John Stillwell. MR 607504
- 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)
- 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)
- H. Rogers, Jr. Theory of recursive functions and effective computability, McGraw-Hill, New York, 1968. MR 0224462 (37:61)
- J.-P. Serre, Trees (translated by J. Stillwell), Springer-Verlag, Berlin, 1980. MR 607504 (82c:20083)
Retrieve articles in Proceedings of the American Mathematical Society
Retrieve articles in all journals
graph of groups,
free product with amalgamation
© Copyright 1989
American Mathematical Society