✦ LIBER ✦

Algorithmic dimension of nilpotent groups

✍ Scribed by S. S. Goncharov; B. N. Drobotun

Publisher: SP MAIK Nauka/Interperiodica
Year: 1989
Tongue: English
Weight: 620 KB
Volume: 30
Category: Article
ISSN: 0037-4466
DOI: 10.1007/bf00971375

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Nilpotent groups of finite algorithmic d

Nilpotent groups of finite algorithmic dimension

✍ S. S. Goncharov; A. V. Molokov; N. S. Romanovskii 📂 Article 📅 1989 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 600 KB

An algorithmic problem for nilpotent gro

An algorithmic problem for nilpotent groups and rings

✍ V. N. Remeslennikov 📂 Article 📅 1980 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 404 KB

Algorithmic dimension of lattices

✍ V. D. Dzgoev 📂 Article 📅 1992 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 318 KB

Some Algorithms for Nilpotent Permutatio

Some Algorithms for Nilpotent Permutation Groups

✍ Eugene M. Luks; Ferenc Rákóczi; Charles R.B. Wright 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 727 KB

Let G, H and E be subgroups of a finite nilpotent permutation group of degree n. We describe the theory and implementation of an algorithm to compute the normalizer N G (H) in time polynomial in n, and we give a modified algorithm to determine whether H and E are conjugate under G and, if so, to fin

Automorphism groups of nilpotent groups

✍ Gábor Braun; Rüdiger Göbel 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 122 KB

Semivarieties of nilpotent groups

✍ A. I. Budkin 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 334 KB