Searching for small simple automorphic loops

Kenneth W. Johnson, Michael K. Kinyon, Gábor P. Nagy, Petr Vojtěchovský

Research output: Contribution to journalArticlepeer-review

17 Scopus citations

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 non-Associative simple commutative automorphic loop of order less than 212, and no non-Associative simple automorphic loop of order less than 2500. We obtain numerous examples of non-Associative simple right automorphic loops. We also prove that every automorphic loop has the antiautomorphic inverse property, and that a right automorphic loop is automorphic if and only if its conjugations are automorphisms.

Original languageEnglish (US)
Pages (from-to)200-213
Number of pages14
JournalLMS Journal of Computation and Mathematics
Volume14
DOIs
StatePublished - Aug 1 2011

All Science Journal Classification (ASJC) codes

  • General Mathematics
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'Searching for small simple automorphic loops'. Together they form a unique fingerprint.

Cite this