The structure of extra loops
Michael K. Kinyon, Kenneth Kunen

TL;DR
This paper explores the algebraic structure of finite and infinite extra loops, establishing key theorems, properties of centers, and classifications of loops of certain orders, advancing understanding of their algebraic behavior.
Contribution
It proves Sylow and P. Hall theorems for finite extra loops, analyzes centers and quotient structures, and classifies nonassociative extra loops of specific orders.
Findings
Sylow theorems hold for finite extra loops
Finite nonassociative extra loops have nontrivial centers
Exactly 16 nonassociative extra loops of order 16p for each odd prime p
Abstract
The Sylow theorems hold for finite extra loops, as does P. Hall's theorem for finite solvable extra loops. Every finite nonassociative extra loop has a nontrivial center, . Furthermore, is a group whenever . Loop extensions are used to construct an infinite nonassociative extra loop with a trivial center and a nonassociative extra loop of order 512 such that is nonassociative. There are exactly 16 nonassociative extra loops of order for each odd prime .
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
