Simple right conjugacy closed loops
classification
🧮 math.GR
keywords
loopsclosedconjugacyconstructionrightsimplegeneralgive
read the original abstract
We give a general construction for right conjugacy closed loops, using $GL(2,q)$ for $q$ a prime power. Under certain conditions, the loops constructed are simple, giving the first general construction for finite, simple right conjugacy closed loops. We give a complete description of the isomorphism classes for the construction, yielding an exact count of non isomorphic loops for each $q$.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.