Group structure computations in finite chain rings
โ Scribed by M.A De Luis
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 554 KB
- Volume
- 144
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
We show that every (discrete) group ring DยฝG of a free-by-amenable group G over a division ring D of arbitrary characteristic is stably finite, in the sense that one-sided inverses in all matrix rings over DยฝG are two-sided. Our methods use Sylvester rank functions and the translation ring of an ame
We present practical algorithms to compute subgroups such as Hall systems, system normalizers, F-normalizers and F-covering subgroups in finite solvable groups. An application is an algorithm to calculate head complements in finite solvable groups; that is, complements which are closely related to m