Algorithmic solvability of the problem of inclusion in a basis of a free metabelian group

DOI10.1007/BF01206398zbMath0801.20009OpenAlexW2002146678MaRDI QIDQ1311105

E. I. Timoshenko

Publication date: 8 February 1994

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01206398

zbMATH Keywords

group ringsbasefree metabelian groupFox derivative

Mathematics Subject Classification ID

Solvable groups, supersolvable groups (20F16) Group rings of infinite groups and their modules (group-theoretic aspects) (20C07) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Derived series, central series, and generalizations for groups (20F14)

Related Items (5)

Finite separability of tameness and primmvity in certain relatively free groups ⋮ On primitive and inner endomorphisms of groups ⋮ ON THE STABILIZER OF A COLUMN IN A MATRIX GROUP OVER A POLYNOMIAL RING ⋮ Uniformly Distributed Systems of Elements on Metabelian Lie Rings ⋮ Primitive elements of the free groups of the varieties \({\mathfrak AN}_n\)

Cites Work

• Projective modules over polynomial rings
• Unnamed Item

This page was built for publication: Algorithmic solvability of the problem of inclusion in a basis of a free metabelian group