Related papers: The varieties of loops of Bol-Moufang type
A quasigroup identity is of Bol-Moufang type if two of its three variables occur once on each side, the third variable occurs twice on each side, the order in which the variables appear on both sides is the same, and the only binary…
There are a number of identities which, if satisfied by a Bol loop, imply that the loop is actually Moufang. In this paper we show that in a number of cases, the Moufang identity is also forced not by a single identity, but by giving…
We describe all constructions for loops of Bol-Moufang type analogous to the Chein construction $M(G,*,g_0)$ for Moufang loops.
We count number of groupoids of order 3 with some Bol-Moufang type identities.
A loop $(Q,\cdot,\backslash,/)$ is called a middle Bol loop if it obeys the identity $x(yz\backslash x)=(x/z)(y\backslash x)$. In this paper, some new algebraic properties of a middle Bol loop are established. Four bi-variate mappings…
A Bol loop is a loop that satisfies the Bol identity $(xy.z)y=x(yz.y)$. If $L$ is a loop and $f:L\to L$ is a bijection such that $f(xy)\in\{f(x)f(y),f(y)f(x)\}$, for every $x$, $y\in L$, then $f$ is called a half-automorphism of $L$. In…
We investigate the relation between the structure of a Moufang loop and its inner mapping group. Moufang loops of odd order with commuting inner mappings have nilpotency class at most two. $6$-divisible Moufang loops with commuting inner…
Some varieties of groupoids and quasigroups generated by linear-bivariate polynomials $P(x,y)=a+bx+cy$ over the ring $\mathbb{Z}_n$ are studied. Necessary and sufficient conditions for such groupoids and quasigroups to obey identities which…
A loop $X$ is said to satisfy Moufang's theorem if for every $x,y,z\in X$ such that $x(yz)=(xy)z$ the subloop generated by $x$, $y$, $z$ is a group. We prove that the variety $V$ of Steiner loops satisfying the identity $(xz)(((xy)z)(yz)) =…
We classify Bol loops of order $27$, using a combination of theoretical results and computer search. There are $15$ Bol loops of order $27$, including five groups. New constructions for the ten nonassociative Bol loops of order $27$ are…
An algebra $\mathbf A = \langle A, \to, 0 \rangle$, where $\to$ is binary and $0$ is a constant, is called an implication zroupoid ($\mathcal I$-zroupoid, for short) if $\mathbf A$ satisfies the identities: (I): $(x \to y) \to z \approx…
A loop $(Q,\cdot,\backslash,/)$ is called a middle Bol loop if it obeys the identity $x(yz\backslash x)=(x/z)(y\backslash x)$. To every right (left) Bol loop corresponds a middle Bol loop via an isostrophism. In this paper, the structure of…
Andrew Rajah posed at the Loops'11 Conference in Trest, Czech Republic, the following conjecture: Is every variety of loops that satisfies Moufang's theorem contained in the variety of Moufang loops? This paper is motivated by that problem.…
Code loops are certain Moufang $2$-loops constructed from doubly even binary codes that play an important role in the construction of local subgroups of sporadic groups. More precisely, code loops are central extensions of the group of…
C-loops are loops satisfying $x(y(yz))=((xy)y)z$. They often behave analogously to Moufang loops and they are closely related to Steiner triple systems and combinatorics. We initiate the study of C-loops by proving: (i) Steiner loops are…
In this paper are defined cohomology-like groups that classify loop extensions satisfying a given identity in three variables for association identities, and in two variables for the case of commutativity. It is considered a large amount of…
Automorphic loops are loops in which all inner mappings are automorphisms. This variety of loops includes groups and commutative Moufang loops. A half-isomorphism $f : G \longrightarrow K$ between multiplicative systems $G$ and $K$ is a…
We construct a Moufang loop $M$ of order $3^{19}$ and a pair $a,b$ of its elements such that the set of all elements of $M$ that associate with $a$ and $b$ does not form a subloop. This is also an example of a nonassociative Moufang loop…
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…
In this work we construct free Moufang loop in the variety generated by code loops. We apply this construction for study the code loops. Moreover, we define and determine all basic representations of code loops of rank 3 and 4.