Algebra and Logic

, Volume 8, Issue 6, pp 404–411 | Cite as

Conjugacy in polycyclic groups

  • V. N. Remeslennikov


Mathematical Logic Polycyclic Group 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature cited

  1. 1.
    Z. I. Borevich and I. R. Shafarevich, Theory of Numbers [in Russian], Moscow (1964).Google Scholar
  2. 2.
    O. Zariski and P. Samuel, Commutative Algebra [Russian translation], Vol. 2, IL, Moscow (1963).Google Scholar
  3. 3.
    M. I. Kargapolov, “Conjugacy in supersolvable groups,” Algebra i Logika,6, No. 1, 63–68 (1967).Google Scholar
  4. 4.
    A. I. Mal'tsev, “Homomorphisms onto finite groups,” Uch. Zap. Ivan. Gos. Ped. Inst.,18, 49–60 (1958).Google Scholar
  5. 5.
    A. I. Mal'tsev, “Some classes of infinite solvable groups,” Matem. Sb.,28, 567–588 (1951).Google Scholar
  6. 6.
    V. N. Remeslennikov, “Finite approximation of metabelian groups,” Algebra i Logika,7, No. 4, 106–113 (1968).Google Scholar
  7. 7.
    K. A. Hirsch, “On infinite soluble groups,” IY, J. London Math. Soc.,27, 81–85 (1952).Google Scholar
  8. 8.
    N. Blackburn, “Conjugacy in nilpotent groups,” Proc. Amer. Math. Soc.,16, 143–148 (1965).Google Scholar

Copyright information

© Consultants Bureau 1971

Authors and Affiliations

  • V. N. Remeslennikov

There are no affiliations available

Personalised recommendations