Decidable Properties of Polycyclic Groups

DOI10.1112/PLMS/S3-61.3.497MaRDI QIDQ3828191zbMATH OpenOpenAlexFDO

Authors Dan 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

algorithmarithmetic groupautomorphismconjugacy of subgroupsconjugacy problemfinite presentationsfinitely generated torsion-free nilpotent groupHilbert's 10th problemisomorphism problempolycyclic-by-finite groupsundecidability

Mathematics Subject Classification ID

Automorphisms of infinite groups (20E36) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Solvable groups, supersolvable groups (20F16) Linear algebraic groups over global fields and their integers (20G30)

Recommendations

• The algorithmic theory of polycyclic-by-finite groups
• Practical algorithms for polycyclic matrix groups
• The isomorphism problem for residually torsion-free nilpotent groups.
• The twisted conjugacy problem for endomorphisms of polycyclic groups
• scientific article; zbMATH DE number 67424

Cited in

(25)

• 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.
• The isomorphism problem for residually torsion-free nilpotent 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.
• The status of polycyclic group-based cryptography: a survey and open problems
• Generation of polycyclic groups
• Deciding if an automorphism of an infinite soluble group is inner
• Decision problems concerning S-arithmetic groups
• The Algorithmic Theory of Finitely Generated Metabelian Groups
• Decidability for ℤ2G-lattices whenG Extends the Noncyclic Group of Order 4
• Derivations and the permutability of subgroups in polycyclic-by-finite groups
• Group-theoretic orbit decidability.
• Algorithmic problems in Engel groups and cryptographic applications
• The isomorphism problem for all hyperbolic groups.
• Computable Scott sentences and the weak Whitehead problem for finitely presented groups
• On the minimal generator number of a polycyclic nilpotent-by-finite group
• On rigidity and the isomorphism problem for tree braid groups.
• The isomorphism problem for finitely generated fully residually free groups.

This page was built for publication: Decidable Properties of Polycyclic Groups

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