A remark on -systems in groups
Groups are usually axiomatized as algebras with an associative binary operation, a two-sided neutral element, and with two-sided inverses. We show in this note that the same simplicity of axioms can be achieved for some of the most important varieties of loops. In particular, we investigate loops of Bol-Moufang type in the underlying variety of magmas with two-sided inverses, and obtain ``group-like'' equational bases for Moufang, Bol and C-loops. We also discuss the case when the inverses are only...
The theorem about the characterization of a GS-quasigroup by means of a commutative group in which there is an automorphism which satisfies certain conditions, is proved directly.
A (finite) acyclic connected graph is called a tree. Let be a finite nonempty set, and let be the set of all trees with the property that is the vertex set of . We will find a one-to-one correspondence between and the set of all binary operations on which satisfy a certain set of three axioms (stated in this note).
In this article the “geometric” concept of the affine regular decagon in a general GS–quasigroup is introduced. The relationships between affine regular decagon and some other geometric concepts in a general GS–quasigroup are explored. The geometrical presentation of all proved statements is given in the GS–quasigroup .
The concept of the affine regular icosahedron and affine regular octahedron in a general GS-quasigroup will be introduced in this paper. The theorem of the unique determination of the affine regular icosahedron by means of its four vertices which satisfy certain conditions will be proved. The connection between affine regular icosahedron and affine regular octahedron in a general GS-quasigroup will be researched. The geometrical representation of the introduced concepts and relations between them...
Algebraic aspects of web geometry, namely its connections with the quasigroup and loop theory, the theory of local differential quasigroups and loops, and the theory of local algebras are discussed.
G. B. Belyavskaya and G. L. Mullen showed the existence of a complement for a -tuple of orthogonal -ary operations, where , to an -tuple of orthogonal -ary operations. But they proposed no method for complementing. In this article, we give an algorithm for complementing a -tuple of orthogonal -ary operations to an -tuple of orthogonal -ary operations and an algorithm for complementing a -tuple of orthogonal -ary operations to an -tuple of orthogonal -ary operations. Also we find some...
Characterizations of 'almost associative' binary operations generating a minimal clone are given for two interpretations of the term 'almost associative'. One of them uses the associative spectrum, the other one uses the index of nonassociativity to measure how far an operation is from being associative.