The Algorithmic Theory of Finitely Generated Metabelian Groups

DOI10.2307/2154499MaRDI QIDQ4311344zbMATH OpenOpenAlexFDO

Authors 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

algorithmsassociated set of primescentralizerscentrederived subgroupfinitary presentationsfinitely generated metabelian groupsfinitely generated modulesFitting subgroupFrattini subgroupgroup algebrasintersection of maximal submoduleslower central seriesnearly normal subgroupsorders of elements

Mathematics Subject Classification ID

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

Recommendations

• A new look at finitely generated metabelian groups.
• Recognizing free metabelian groups
• The algorithmic theory of polycyclic-by-finite groups
• The algebraic structure of finite metabelian group algebras.
• Subgroups of free metabelian groups.

Cites work

• Algorithmically insoluble problems about finitely presented solvable groups, Lie and associative algebras. I
• Computable algebra and group embeddings
• Constructions in a Polynomial Ring Over the Ring of Integers
• Constructions in Algebra
• Decidable Properties of Polycyclic Groups
• Finiteness Conditions for Soluble Groups
• Gröbner bases and primary decomposition of polynomial ideals
• scientific article; zbMATH DE number 3762288 (Why is no real title available?)
• scientific article; zbMATH DE number 3773872 (Why is no real title available?)
• scientific article; zbMATH DE number 42070 (Why is no real title available?)
• Infinitely generated subgroups of finitely presented groups. II
• On a Class of Metabelian Groups
• The algorithmic theory of polycyclic-by-finite groups
• The Free Metabelian Group of Rank Two Contains Continuously Many Nonisomorphic Subgroups

Cited in

(16)

• Explicit test sets for iterated morphisms in free monoids and metabelian groups
• The \(p\)-group generation algorithm
• Positive elements and sufficient conditions for solvability of the submonoid membership problem for nilpotent groups of class two
• A new look at finitely generated metabelian groups.
• The twisted conjugacy problem for endomorphisms of polycyclic groups
• The twisted conjugacy problem for endomorphisms of metabelian groups.
• ON TORSION-FREE METABELIAN GROUPS WITH COMMUTATOR QUOTIENTS OF PRIME EXPONENT
• Amenable groups without finitely presented amenable covers
• Diophantine cryptography over infinite groups
• Subgroups of free metabelian groups.
• Localization, metabelian groups, and the isomorphism problem
• Residual properties of graph manifold groups
• Tilings and submonoids of metabelian groups.
• On isomorphisms to a free group and beyond
• The isomorphism problem for a class of finitely generated metabelian groups
• On the first-order genus of wreath products and their central extensions

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

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