Algorithmic solvability of the problem of inclusion in a basis of a free metabelian group (Q1311105)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Algorithmic solvability of the problem of inclusion in a basis of a free metabelian group |
scientific article |
Statements
Algorithmic solvability of the problem of inclusion in a basis of a free metabelian group (English)
0 references
8 February 1994
0 references
Let \(S\) be a free metabelian group with a base \(x_ 1,\dots,x_ n\) and \(G = S/S'\). For an element \(v \in S\) denote by \(D_ i(v)\) the image of the Fox derivative \(\partial v\over \partial x_ i\) in \(\mathbb{Z} G\). Let \(v_ 1,\dots,v_ m \in S\), \(m \neq n - 2\). Denote by \(M\) the matrix \(\left( {\partial v_ i\over \partial x_ j}\right)\). The main result of the paper states that the elements \(v_ 1,\dots,v_ m\) can be included in a base of \(S\) if and only if the ideal of \(\mathbb{Z} G\) generated by all minors of size \(m\) in \(\mathbb{Z} G\) is equal to \(\mathbb{Z} G\).
0 references
group rings
0 references
free metabelian group
0 references
base
0 references
Fox derivative
0 references