Computable algebra and group embeddings

DOI10.1016/0021-8693(81)90138-1zbMATH Open0497.20023OpenAlexW2014947521MaRDI QIDQ1170619FDOQ1170619

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

algorithmsfinitely presented modulepolycyclic grouphomology groupscountable metabelian groupembedding groups in finitely presented groupsgrouprings of nilpotent groupslocally abelian-by-nilpotent group

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (15)

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

This page was built for publication: Computable algebra and group embeddings

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