Searching for small simple automorphic loops
arXiv:1006.3886 · doi:10.1112/S1461157010000173
Abstract
A loop is (right) automorphic if all its (right) inner mappings are automorphisms. Using the classification of primitive groups of small degrees, we show that there is no nonassociative simple commutative automorphic loop of order less than , and no nonassociative simple automorphic loop of order less that 2500. We obtain examples of nonassociative simple right automorphic loops.
15 pages. V2: revisions following suggestions of referee, to appear in LMS J. Computation and Mathematics