Skip to main content
Log in

Occurrence problem for free solvable groups

  • Published:
Algebra and Logic Aims and scope

Abstract

We study the problem on the existence of an algorithm verifying whether systems of linear equations over a group ring of a free metabelian group are solvable. The occurrence problem for free solvable groups of derived length ≥ 3is proved undecidable. We give an example of a group with undecidable word problem which is finitely presented in a variety of solvable groups and is defined by the relations from the last commutator subgroup.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. W. Magnus, A. Karrass, and D. Solitar,Combinatorial Group Theory, Interscience, New York (1966).

    Google Scholar 

  2. K. A. Mikhailova, “Occurrence problem for free products of groups,”Dokl. Akad. Nauk SSSR,127, 746–748 (1959).

    Google Scholar 

  3. K. A. Mikhailova, “Occurrence problem for direct products of groups,”Dokl. Akad. Nauk SSSR,119, 1103–1105 (1958).

    Google Scholar 

  4. N. S. Romanovskii, “Occurrence problem for extensions of Abelian groups by nilpotent groups,”Sib. Mat. Zh.,21, No. 2, 170–174 (1980).

    Google Scholar 

  5. S. A. Agalakov, “Finite separability of groups and Lie algebras,”Algebra Logika,22, No. 4, 363–371 (1983).

    Google Scholar 

  6. G. A. Noskov, V. N. Remeslennikov, and V. A. Roman'kov, “Infinite groups,”Itogi Nauki Tekhniki. Algebra, Geometry, and Topology,17, 65–157 (1979).

    Google Scholar 

  7. D. E. Cohen,Groups of Cohomological Dimension One. Lecture Notes Math.,245, Springer, Berlin (1972).

    Google Scholar 

  8. E. I. Timoshenko, “Algorithmic problems for metabelian groups,”Algebra Logika,12, No. 2, 232–240 (1973).

    Google Scholar 

  9. V. I. Epanchintsev and G. P. Kukin, “The word problem in a variety of groups containing\(\mathfrak{N}_2 \mathfrak{A}\),”Algebra Logika,18, No. 3, 259–285 (1979).

    Google Scholar 

  10. O. G. Kharlampovich, “Finitely presented solvable group with undecidable word problem,”Izv. Akad. Nauk SSSR, Ser. Mat.,45, No. 4, 852–873 (1981).

    Google Scholar 

  11. V. G. Sokolov, “An algorithm for solving the word problem in some class of solvable groups,”Sib. Mat. Zh.,12, No. 6, 1405–1410 (1971).

    Google Scholar 

  12. U. U. Umirbaev, “The occurrence problem for Lie algebras,”Algebra Logika,32, No. 3, 326–340 (1993).

    Google Scholar 

  13. R. H. Fox, “Free differential calculus. I,”Ann. Math.,57, 547–560 (1953).

    Google Scholar 

  14. V. N. Remeslennikov and V. G. Sokolov, “Some properties of a Magnus embedding,”Algebra Logika,9, No. 5, 566–578 (1970).

    Google Scholar 

  15. S. Bachmuth, “Automorphisms of free metabelian groups,”Trans. Am. Math. Soc.,118, No. 6, 93–104 (1965).

    Google Scholar 

  16. A. I. Mal'tsev,Algorithms and Recursive Functions [in Russian], 2nd edn., Mir, Moscow (1986).

    Google Scholar 

Download references

Authors

Additional information

Translated fromAlgebra i Logika, Vol. 34, No. 2, pp. 211-232, March-April, 1995.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Umirbaev, U.U. Occurrence problem for free solvable groups. Algebr Logic 34, 112–124 (1995). https://doi.org/10.1007/BF00750164

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00750164

Keywords

Navigation