Code loops are RA2 loops (Q909804)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Code loops are RA2 loops |
scientific article; zbMATH DE number 4138057
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Code loops are RA2 loops |
scientific article; zbMATH DE number 4138057 |
Statements
Code loops are RA2 loops (English)
0 references
1990
0 references
The authors prove that a nonassociative Moufang loop with a unique nonidentity square must, in fact, have an alternative loop ring over any ring of characteristic two. So, the main result of the paper is the Theorem: If L is a nonassociative Moufang loop with a unique nonidentity square, e, then L is an RA2 loop. An RA2 loop is a nonassociative loop whose loop ring over some ring of characteristic two is alternative.
0 references
nonassociative Moufang loop
0 references
alternative loop ring
0 references
RA2 loop
0 references
