Conjugacy in abelian-by-cyclic groups
HTML articles powered by AMS MathViewer
- by James Boler PDF
- Proc. Amer. Math. Soc. 55 (1976), 17-21 Request permission
Abstract:
It is shown that each finitely generated torsion-free abelian-by-cyclic group has solvable conjugacy problem. This is done by showing that solving the conjugacy problem for these groups is equivalent to a certain decision problem for modules over the complex group algebra of an infinite cyclic group.References
-
J. Boler, Embedding and conjugacy in metabelian groups, Thesis, Rice University, 1974.
E. Formanek, Matrix techniques in polycyclic groups, Thesis, Rice University, 1970.
- I. N. Herstein, Topics in algebra, Blaisdell Publishing Co. [Ginn and Co.], New York-Toronto-London, 1964. MR 0171801 W. Magnus, A. Karass and D. Solitar, Combinatorial group theory: Presentations of groups in terms of generators and relations, Pure and Appl. Math., vol. 8, Interscience, New York, 1966, p. 55. MR 34 #7617.
Additional Information
- © Copyright 1976 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 55 (1976), 17-21
- DOI: https://doi.org/10.1090/S0002-9939-1976-0399266-2
- MathSciNet review: 0399266