Computable algebra and group embeddings

DOI10.1016/0021-8693(81)90138-1zbMath0497.20023OpenAlexW2014947521MaRDI QIDQ1170619

Frank B. Cannonito, Charles F. III Miller, Gilbert Baumslag

Publication date: 1981

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-8693(81)90138-1

zbMATH Keywords

algorithmspolycyclic grouphomology groupsfinitely presented modulecountable metabelian groupembedding groups in finitely presented groupsgrouprings of nilpotent groupslocally abelian-by-nilpotent group

Mathematics Subject Classification ID

Subgroup theorems; subgroup growth (20E07) Group rings of infinite groups and their modules (group-theoretic aspects) (20C07) Generators, relations, and presentations of groups (20F05) Homological methods in group theory (20J05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items

The conjugacy problem for centre-by-metabelian groups, Deciding if an automorphism of an infinite soluble group is inner, Localization, metabelian groups, and the isomorphism problem, Some recognizable properties of solvable groups, Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm, The algorithmic theory of polycyclic-by-finite groups, Ideals in computable rings, The complexity of module radicals, Subgroups of free metabelian groups., The non-abelian tensor product of polycyclic groups is polycyclic, The Algorithmic Theory of Finitely Generated Metabelian Groups, On some closure properties of the non-abelian tensor product, On recognizing cyclic modules effectively, Model-theoretic and algorithmic questions in group theory, Isoperimetric inequalities and the homology of groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infinitely generated subgroups of finitely presented groups. II
• Some algorithmic problems for solvable groups
• Infinitely generated subgroups of finitely presented groups. I
• Finite approximability of metabelian groups
• On groups satisfying Poincaré duality
• Guppen mit Poincaré-Dualität
• Constructions in Algebra
• Computable Algebra, General Theory and Theory of Computable Fields
• On the faithful representation of infinite groups by matrices
• Constructive Aspects of Noetherian Rings
• Finiteness Conditions for Soluble Groups
• On Infinite Soluble Groups (III)