Buchsteiner loops: associators and constructions
Ales Drapal, Michael Kinyon

TL;DR
This paper investigates the structure of Buchsteiner loops, providing bounds on their order, describing a construction method for certain sizes, and presenting a specific example with particular algebraic properties.
Contribution
It introduces a detailed associator calculus for Buchsteiner loops, establishes order bounds, and offers a construction method for loops of order 32, including a novel example of order 128.
Findings
|Q| ≥ 32 if not conjugacy closed
|Q| ≥ 64 if some element's square is outside the nucleus
Constructed a loop of order 128 with nilpotency class 3
Abstract
Let be a Buchsteiner loop. We describe the associator calculus in three variables, and show that if is not conjugacy closed. We also show that if there exists such that is not in the nucleus of . Furthermore, we describe a general construction that yields all proper Buchsteiner loops of order 32. Finally, we produce a Buchsteiner loop of order 128 that is nilpotency class 3 and possesses an abelian inner mapping group.
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
