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)

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

Mathematics Subject Classification ID

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

Cites work

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

Cited in

(14)

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

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)