The Algorithmic Theory of Finitely Generated Metabelian Groups

DOI10.2307/2154499zbMath0821.20019OpenAlexW4249493606MaRDI QIDQ4311344

Gilbert Baumslag, Derek J. S. Robinson, Frank B. Cannonito

Publication date: 4 October 1995

Full work available at URL: https://doi.org/10.2307/2154499

zbMATH Keywords

algorithmsgroup algebrasfinitely generated modulescentralizerslower central seriesFrattini subgroupFitting subgrouporders of elementsderived subgroupnearly normal subgroupsfinitely generated metabelian groupscentreintersection of maximal submodulesassociated set of primesfinitary presentations

Mathematics Subject Classification ID

Subgroup theorems; subgroup growth (20E07) Solvable groups, supersolvable groups (20F16) Group rings of infinite groups and their modules (group-theoretic aspects) (20C07) Generators, relations, and presentations of groups (20F05) Chains and lattices of subgroups, subnormal subgroups (20E15) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Applications of logic to commutative algebra (13L05)

Related Items (11)

Localization, metabelian groups, and the isomorphism problem ⋮ Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two ⋮ Tilings and submonoids of metabelian groups. ⋮ The twisted conjugacy problem for endomorphisms of metabelian groups. ⋮ The twisted conjugacy problem for endomorphisms of polycyclic groups ⋮ Subgroups of free metabelian groups. ⋮ Explicit test sets for iterated morphisms in free monoids and metabelian groups ⋮ Residual properties of graph manifold groups ⋮ Amenable groups without finitely presented amenable covers ⋮ Unnamed Item ⋮ ON TORSION-FREE METABELIAN GROUPS WITH COMMUTATOR QUOTIENTS OF PRIME EXPONENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Infinitely generated subgroups of finitely presented groups. II
• Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. I
• Gröbner bases and primary decomposition of polynomial ideals
• Computable algebra and group embeddings
• The algorithmic theory of polycyclic-by-finite groups
• The Free Metabelian Group of Rank Two Contains Continuously Many Nonisomorphic Subgroups
• Constructions in a Polynomial Ring Over the Ring of Integers
• On a Class of Metabelian Groups
• Decidable Properties of Polycyclic Groups
• Constructions in Algebra
• Finiteness Conditions for Soluble Groups

This page was built for publication: The Algorithmic Theory of Finitely Generated Metabelian Groups