Commutative subloop-free loops. (Q2897367)
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: Commutative subloop-free loops. |
scientific article; zbMATH DE number 6054236
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Commutative subloop-free loops. |
scientific article; zbMATH DE number 6054236 |
Statements
10 July 2012
0 references
commutative loops
0 references
multiplication groups
0 references
alternating groups
0 references
partial Latin squares
0 references
Commutative subloop-free loops. (English)
0 references
The authors present an effective construction which shows that for any \(n\geq 7\), there exists a commutative loop with no proper subloops whose multiplication group is the alternating group of order \(n\). The proposed construction starts with a partial Latin square called a template. The Cayley table is then completed in a way suggested in the paper.
0 references
0.7932265996932983
0 references
0.7877885103225708
0 references
0.780264139175415
0 references
0.7681052684783936
0 references
