Construction of a class of loops via graphs. (Q2380490)

The author proposes a constructive technique in order to obtain an involutorial difference loop (ID-loop) of order \(2n\) starting from one of order \(n\) exploiting either the properties of the associated graph or those of the involution set \(I\) acting transitively on a set \(P\) [\textit{H. Karzel} and \textit{H. Wefelscheid}, Result. Math. 23, No. 3-4, 338-354 (1993; Zbl 0788.20034); \textit{H. Karzel, S. Pianta} and \textit{E. Zizioli}, Proceedings of the conference on nearrings and nearfields, Hamburg 2003. Dordrecht: Springer. 235-252 (2005; Zbl 1097.20054), Result. Math. 42, No. 1-2, 74-80 (2002; Zbl 1046.20043)]. After recalling some basic notions and the fundamental relationships among ID-loops, colored graphs and the set \(I\) of involutions the author proceeds to the duplication of the ID-loop \((P,+)\), to investigate the case wherein the new loops inherits from \((P,+)\) the K-loop property, to some examples of loops of order 8 obtained via this procedure. Finally she presents a possible generalization of this method to triplicate an ID-loop.