On abelian-by-cyclic Moufang loops
Ale\v{s} Dr\'apal, Petr Vojt\v{e}chovsk\'y

TL;DR
This paper classifies and constructs abelian-by-cyclic Moufang loops using special permutations called Moufang permutations and introduces construction pairs, revealing conditions under which these loops are groups.
Contribution
It provides a complete construction method for split 3-divisible abelian-by-cyclic Moufang loops using Moufang permutations and extends this with construction pairs.
Findings
All split 3-divisible abelian-by-cyclic Moufang loops can be constructed from Moufang permutations.
The abelian subgroup induces an abelian congruence only when the loop is a group.
New classes of abelian-by-cyclic Moufang loops are obtained via construction pairs.
Abstract
We study abelian-by-cyclic Moufang loops. We construct all split -divisible abelian-by-cyclic Moufang loops from so-called Moufang permutations on abelian groups , which are permutations that deviate from an automorphism of by an alternating biadditive mapping (satisfying certain properties). More generally, we obtain additional abelian-by-cyclic Moufang loops from so-called construction pairs. As an aside, we show that in the Moufang loops obtained from a construction pair on the abelian normal subgroup induces an abelian congruence of if and only if is a 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
Topicsgraph theory and CDMA systems · Mathematics and Applications
