On multiplication groups of loops
✍ Scribed by Markku Niemenmaa; Tomáš Kepka
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 551 KB
- Volume
- 135
- Category
- Article
- ISSN
- 0021-8693
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
For a loop Q denote by Mlt Q the permutation group generated by translations where F is a finite field with at least five elements, and if Mlt Q ≤ PΓL 2 F , then Q is an abelian group. The same result holds for an infinite field F, if the automorphisms associated with translations generate a finite
Let S be a finite subset of a group G, |S| = n, and let g ∈ S • S. Then g induces a partial function λ g : S → S by λ g (s) = t if and only if st = g and λ g (s) is not defined if g ∈ sS. For every g ∈ S • S, λ g is a one-to-one mapping. In this note we describe the groups which have a finite genera