The structure of automorphic loops
Michael Kinyon, Ken Kunen, J. D. Phillips, Petr Vojtechovsky

TL;DR
This paper investigates the structure and properties of automorphic loops, especially those of odd order, establishing their solvability, subgroup divisibility, and the nonexistence of certain simple loops, while constructing specific nonassociative examples.
Contribution
It provides new results on the structure, solvability, and classification of automorphic loops, including the construction of nonassociative automorphic loops of certain orders and the proof of nonexistence of simple nonassociative automorphic loops below order 2500.
Findings
Automorphic loops of odd order are solvable.
No finite simple nonassociative automorphic loops of order less than 2500.
Existence of nonassociative automorphic loops of order p^3 and dihedral loops of order 2n.
Abstract
Automorphic loops are loops in which all inner mappings are automorphisms. This variety of loops includes, for instance, groups and commutative Moufang loops. We study uniquely 2-divisible automorphic loops, particularly automorphic loops of odd order, from the point of view of the associated Bruck loops (motivated by Glauberman's work on uniquely 2-divisible Moufang loops) and the associated Lie rings (motivated by a construction of Wright). We prove that every automorphic loop of odd order is solvable, contains an element of order for every prime dividing , and divides for every subloop of . There are no finite simple nonassociative commutative automorphic loops, and there are no finite simple nonassociative automorphic loops of order less than 2500. We show that if is a finite simple nonassociative automorphic loop then the socle of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematics and Applications · graph theory and CDMA systems · History and Theory of Mathematics
