Some algorithmic problems for solvable groups

DOI10.1007/BF01462922zbMath0297.20043MaRDI QIDQ1213972

N. S. Romanovskii

Publication date: 1975

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

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Chains and lattices of subgroups, subnormal subgroups (20E15) Finite nilpotent groups, (p)-groups (20D15) Applications of computability and recursion theory (03D80)

Related Items

The conjugacy problem for centre-by-metabelian groups, Unsolvable algorithmic problems for semigroups, groups and rings, Some properties of elements of the group \(F/[N,N\)], 3XOR games with perfect commuting operator strategies have perfect tensor product strategies and are decidable in polynomial time, Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two, Infinite groups, Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm, Polynomially computable structures with finitely many generators, Computable algebra and group embeddings, Finitely generated structures computable in polynomial time, Model-theoretic and algorithmic questions in group theory

Cites Work

• Unnamed Item
• On the descending central series of groups with a single defining relation
• A FREEDOM THEOREM FOR GROUPS WITH ONE DEFINING RELATION IN THE VARIETIES OF SOLVABLE AND NILPOTENT GROUPS OF GIVEN LENGTHS