Loops, regular permutation sets and colourings of directed graphs. (Q2352469): Difference between revisions

The authors establish in this paper a correspondence among loops, regular permutation sets and directed graphs with a suitable edge colouring and characterize regular permutation sets and, respectively, colored graphs giving rise to the same loop, to isomorphic loops and to isotopic loops. According to the authors this paper is placed in the line of investigations aiming at describing several geometric structures by means of algebraic structures such as loops and regular permutation sets. [See \textit{H. Karzel}, Quasigroups Relat. Syst. 15, No. 1, 47-76 (2007; Zbl 1134.20068); \textit{H. Karzel} et al., Aequationes Math. 87, No. 1-2, 31-42 (2014; Zbl 1300.51011).] In particular the authors, in recent papers, [see \textit{S. Pasotti} and \textit{E. Zizioli}, Result. Math. 65, No. 1-2, 193-212 (2014; Zbl 1314.20057); and \textit{S. Pasotti} and \textit{E. Zizioli}, J. Geom. 100, No. 1-2, 129-145 (2011; Zbl 1237.20059)], exploiting the correspondence between regular permutation sets and loops, provided a technique for building new loops. In this paper, motivated by these results, the authors deepen the investigation of the relationships holding between regular permutation sets and loops, in order to provide a more complete framework to operate with. Indeed many different regular permutation sets can be associated to the same loop, thus they introduce a relation called loop-equivalence characterizing such regular permutation sets and, further on, the authors characterize regular permutation sets giving rise to isomorphic and isotopic loops. Moreover they propose a generalization of the idea of describing loops by means of complete graphs with a suitable edge-colouring already introduced [in \textit{E. Zizioli}, Result. Math. 38, No. 1-2, 187-194 (2000; Zbl 0954.20040); and \textit{H. Karzel} et al., Result. Math. 42, No. 1-2, 74-80 (2002; Zbl 1046.20043)]. In the last section the authors introduce the correspondence with complete directed graphs.