✦ LIBER ✦

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

✍ Scribed by E. I. Timoshenko

Publisher: SP MAIK Nauka/Interperiodica
Year: 1992
Tongue: English
Weight: 312 KB
Volume: 51
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01206398

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithmic solvability of the word prob

Algorithmic solvability of the word problem for some varieties of linear quasigroups

✍ A. Kh. Tabarov 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 127 KB

An efficient algorithm for constructing

An efficient algorithm for constructing the basis of a subgroup of a free group

✍ A. A. Letichevskii; A. B. Godlevskii; S. L. Krivoi 📂 Article 📅 1982 🏛 Springer US 🌐 English ⚖ 1022 KB

The Mal'tsev-Nielsen equation in a free

The Mal'tsev-Nielsen equation in a free metabelian group of rank two

✍ V. G. Durnev 📂 Article 📅 1989 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 212 KB

Solvability of equivalence problems in a

Solvability of equivalence problems in a system of algorithmic algebras

✍ P. M. Ivanov 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 452 KB

The normalizer of a metabelian group in

The normalizer of a metabelian group in its integral group ring

✍ Yuanlin Li 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 102 KB

In this paper, we discuss two cases where all C-automorphisms are inner; therefore, the normalizer property holds for those cases. Our results generalize a result of Marciniak and Roggenkamp. As an application of our theorems, we prove that the normalizer property holds for the integral group ring o

The hypercentral structure of the group

The hypercentral structure of the group of unitriangular automorphisms of a free metabelian Lie algebra

✍ A. N. Kabanov 📂 Article 📅 2009 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 120 KB