๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An algorithmic problem for nilpotent groups and rings

โœ Scribed by V. N. Remeslennikov

Publisher
SP MAIK Nauka/Interperiodica
Year
1980
Tongue
English
Weight
404 KB
Volume
20
Category
Article
ISSN
0037-4466

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

A nilpotent quotient algorithm for grade
A nilpotent quotient algorithm for graded Lie rings
โœ George Havas; M.F. Newman; M.R. Vaughan-Lee ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 815 KB

A nilpotent quotient algorithm for graded Lie rings of prime characteristic is described. The algorithm has been implemented and applications have been made to the investigation of the associated Lie rings of Burnside groups. New results about Lie rings and Burnside groups are presented. These inclu

Algorithms for Finite Near-rings and the
Algorithms for Finite Near-rings and theirN-groups
โœ Franz Binder; Peter Mayr ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 337 KB

In this note, we present algorithms to deal with finite near-rings, the appropriate algebraic structure to study non-linear functions on finite groups. Just as rings (of matrices) operate on vector spaces, near-rings operate on groups. In our approach, we have developed efficient algorithms for a va