Enumeration of Nilpotent Loops by Orbit Counting
Fariha Iftikhar, G\'abor P. Nagy

TL;DR
This paper develops an orbit counting method to enumerate nilpotent loops by analyzing central extensions and automorphism group actions, successfully reproducing known results and extending enumeration to order 24.
Contribution
Introduces an affine automorphism group approach for counting isomorphism classes of nilpotent loops via orbit analysis, enabling efficient enumeration.
Findings
Reproduces known nilpotent loops of order less than 24
Enumerates nilpotent loops of order 24 with large centers
Provides a new framework for classifying nilpotent loops
Abstract
We study central extensions of nilpotent loops by elementary abelian -groups using normalized cocycles. By introducing an affine automorphism group acting on the full cocycle space, we obtain a direct correspondence between affine orbits and isomorphism classes of central extensions. This framework yields an efficient orbit-counting method for enumerating nilpotent loops. We reproduce the known results for orders less than 24, and enumerate the nilpotent loops of order 24 with center of size at least 3.
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 · Finite Group Theory Research
