Decidable Properties of Polycyclic Groups

DOI10.1112/plms/s3-61.3.497zbMath0674.20020MaRDI QIDQ3828191

Daniel Segal

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

zbMATH Keywords

algorithm; undecidability; polycyclic-by-finite groups; automorphism; Hilbert's 10th problem; isomorphism problem; arithmetic group; conjugacy problem; finite presentations; conjugacy of subgroups; finitely generated torsion-free nilpotent group

Mathematics Subject Classification ID

20F16: Solvable groups, supersolvable groups

20E36: Automorphisms of infinite groups

20G30: Linear algebraic groups over global fields and their integers

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

Related Items

The Algorithmic Theory of Finitely Generated Metabelian Groups, Derivations and the permutability of subgroups in polycyclic-by-finite groups, Algorithmic problems in Engel groups and cryptographic applications, The status of polycyclic group-based cryptography: a survey and open problems, The isomorphism problem for all hyperbolic groups., On rigidity and the isomorphism problem for tree braid groups., The isomorphism problem for finitely generated fully residually free groups., The isomorphism problem for toral relatively hyperbolic groups., The algorithmic theory of polycyclic-by-finite groups, Computing presentations for subgroups of polycyclic groups and of context-free groups, Deciding isomorphy using Dehn fillings, the splitting case, A practical algorithm for finding matrix representations for polycyclic groups, Subgroup conjugacy separability of free-by-finite groups., Algorithmic recognition of infinite cyclic extensions, Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two, Surfaces of general type with geometric genus zero: a survey, Groups with Cyclic Outer Automizers, Generation of polycyclic groups