Binary operations derived from symmetric permutation sets and applications to absolute geometry (Q2468026): Difference between revisions

The authors show two distinct techniques to derive an algebraic structure from a given symmetric permutation set \((P, A)\), and in each case they determine the conditions to be fulfilled by the permutation set in order to get a left loop, or even a loop. The authors also discover some nice links between the two operations and finally consider some applications of these constructions within absolute geometry, where the role of the symmetric permutation set is played by the regular involution set of point reflections. The authors discuss the conditions that are needed to derive from each of the algebraic structures \((P, +), (P,\cdot)\) again a symmetric permutation set and determine in which cases this structure coincides with the original \((P, A)\). The authors also discuss the special case of regular involution sets.