algorithmsfinitely presented modulepolycyclic grouphomology groupscountable metabelian groupembedding groups in finitely presented groupsgrouprings of nilpotent groupslocally abelian-by-nilpotent group
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
- scientific article; zbMATH DE number 3125399 (Why is no real title available?)
- scientific article; zbMATH DE number 3687601 (Why is no real title available?)
- scientific article; zbMATH DE number 3549097 (Why is no real title available?)
- scientific article; zbMATH DE number 3574107 (Why is no real title available?)
- scientific article; zbMATH DE number 3364534 (Why is no real title available?)
- Computable Algebra, General Theory and Theory of Computable Fields
- Constructions in Algebra
- Constructive Aspects of Noetherian Rings
- Finite approximability of metabelian groups
- Finiteness Conditions for Soluble Groups
- Guppen mit Poincaré-Dualität
- Infinitely generated subgroups of finitely presented groups. I
- Infinitely generated subgroups of finitely presented groups. II
- On Infinite Soluble Groups (III)
- On groups satisfying Poincaré duality
- On the faithful representation of infinite groups by matrices
- Some algorithmic problems for solvable groups
Cited in
(15)- Ideals in computable rings
- Some recognizable properties of solvable groups
- Deciding if an automorphism of an infinite soluble group is inner
- Isoperimetric inequalities and the homology of groups
- Implementing the Baumslag-Cannonito-Miller polycyclic quotient algorithm
- The non-abelian tensor product of polycyclic groups is polycyclic
- The complexity of module radicals
- Localization, metabelian groups, and the isomorphism problem
- The Algorithmic Theory of Finitely Generated Metabelian Groups
- The algorithmic theory of polycyclic-by-finite groups
- Model-theoretic and algorithmic questions in group theory
- On some closure properties of the non-abelian tensor product
- The conjugacy problem for centre-by-metabelian groups
- On recognizing cyclic modules effectively
- Subgroups of free metabelian groups.
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)