Algorithmic problems for metabelian groups

DOI10.1007/BF02219297zbMath0282.20026OpenAlexW2028901943MaRDI QIDQ1843841

E. I. Timosenko

Publication date: 1974

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02219297

Mathematics Subject Classification ID

Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (6)

The commutator width of elements in a wreath product of free Abelian groups. ⋮ Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two ⋮ Infinite groups ⋮ Primitivity in the free groups of the variety U_mU_n ⋮ Model-theoretic and algorithmic questions in group theory ⋮ Systems of linear equations over associative algebras and the occurrence problem for lie algebras

Cites Work

• On the Finiteness of Certain Soluble Groups
• Finiteness Conditions for Soluble Groups
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithmic problems for metabelian groups