Searching for small simple automorphic loops

Mathematics – Group Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

15 pages. V2: revisions following suggestions of referee, to appear in LMS J. Computation and Mathematics

Scientific paper

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 $2^{12}$, and no nonassociative simple automorphic loop of order less that 2500. We obtain examples of nonassociative simple right automorphic loops.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Searching for small simple automorphic loops does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Searching for small simple automorphic loops, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Searching for small simple automorphic loops will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-185698

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.