\(G\)-loops and permutation groups (Q1818879)

A loop \(L\) is called a \(G\)-loop if it is isomorphic to all its isotopes. Every finite \(G\)-loop of prime order is a group [\textit{R. L. Wilson} jun., J. Algebra 31, 117-119 (1974; Zbl 0284.20073)]. The loop \(L\) is a right (left) \(G\)-loop if every element is a companion of a right (left) pseudo-automorphism of \(L\). A loop \(L\) is a \(G\)-loop if and only if it is both a left \(G\)-loop and a right \(G\)-loop. The author proves that every right or left \(G\)-loop of prime order is a group; however there are such loops in all composite orders greater than 5. Moreover, the author shows that for a prime \(q>3\), such that 3 does not divide \(q-1\), every \(G\)-loop of order \(3q\) must be a group. From this follows that the automorphism group of a \(G\)-loop \(L\) of order \(pq\) with \(p<q\) and \(p\) does not divide \(q-1\) has order at least 6. At the end of the paper the author gives an example of a \(G\)-loop of order 8 having trivial automorphism group.