Quasigroups determined by balanced identities of length
In a recent paper, those quasigroup identities involving at most three variables and of “length” six which force the quasigroup to be a loop or group have been enumerated by computer. We separate these identities into subsets according to what classes of loops they define and also provide humanly-comprehensible proofs for most of the computer-generated results.
Criteria of recursive differentiability of quasigroups are given. Complete recursive codes which attains the Joshibound are constructed using recursively differentiable -ary quasigroups.
In an absolute space with congruence there are line reflections and point reflections. With the help of point reflections one can define in a natural way an addition + of points which is only associative if the product of three point reflection is a point reflection again. In general, for example for the case that is a linear space with hyperbolic incidence structure, the addition is not associative. is a K-loop or a Bruck loop.
Two suitable composition laws are defined in a regular permutation set in order to find new characterizations of some important classes of loops.
We deal with two types of buildups of 3-configurations: a generating buildup over a given edge set and a regulated one (according to maximal relative degrees of vertices over a penetrable set of vertices). Then we take account to minimal generating edge sets, i.e., to edge bases. We also deduce the fundamental relation between the numbers of all vertices, of all edges from edge basis and of all terminal elements. The topic is parallel to a certain part of Belousov' “Configurations in algebraic...