Enumeration of nilpotent loops via cohomology. (Q2267455)

The authors initiate the classification of small nilpotent loops up to isomorphism, where small means either that the order \(|Q|\) of \(Q\) is a small integer, or that the prime factorization of \(|Q|\) involves few primes. We know that the isomorphism problem for centrally nilpotent loops can be tackled by methods of cohomology. The authors developed tools based on cohomology and linear algebra that either lend themselves to direct count of the isomorphism classes, or lead to efficient classification computer programs. Then the authors enumerated all nilpotent loops of order \(n\) less than 24 up to isomorphism.