Decidable Properties of Polycyclic Groups
DOI10.1112/plms/s3-61.3.497zbMath0674.20020OpenAlexW2026950998MaRDI QIDQ3828191
Publication date: 1990
Published in: Proceedings of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/plms/s3-61.3.497
algorithmundecidabilitypolycyclic-by-finite groupsautomorphismHilbert's 10th problemisomorphism problemarithmetic groupconjugacy problemfinite presentationsconjugacy of subgroupsfinitely generated torsion-free nilpotent group
Solvable groups, supersolvable groups (20F16) Automorphisms of infinite groups (20E36) Linear algebraic groups over global fields and their integers (20G30) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)
Related Items (18)
This page was built for publication: Decidable Properties of Polycyclic Groups