Some algorithmic problems for solvable groups

DOI10.1007/BF01462922MaRDI QIDQ1213972zbMATH OpenFDO

Authors Nikolai S. Romanovskiy

Publication date 1975

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

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3451844 (Why is no real title available?)
• A FREEDOM THEOREM FOR GROUPS WITH ONE DEFINING RELATION IN THE VARIETIES OF SOLVABLE AND NILPOTENT GROUPS OF GIVEN LENGTHS
• On the descending central series of groups with a single defining relation

Cited in

(13)

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

This page was built for publication: Some algorithmic problems for solvable groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1213972)