Related papers: Moufang loops with commuting inner mappings

It is proved that the maximum condition for subloops in a commutative Moufang loop $Q$ is equivalent with the conditions of finite generating of different subloops of the loop $Q$ and different subgroups of the multiplication group of the…

We study loops which are universal (that is, isotopically invariant) with respect to the property of flexibility ($xy\cdot x = x\cdot yx$). We also weaken this to semi-universality, that is, loops in which every left and right isotope is…

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…

It is proved that any free Moufang loop can be embedded in a loop of invertible elements of some alternative algebra.

A loop is automorphic if its inner mappings are automorphisms. Using so-called associated operations, we show that every commutative automorphic loop of odd prime power order is centrally nilpotent. Starting with anisotropic planes in the…

Power graphs of both groups and semigroups have been widely studied. While the power graph of a quasigroup can be defined analogously to that of a group, power graphs of quasigroups and loops have thus far been little studied. In this paper…

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…

It is known that with precision till isomorphism that only and only loops $M(F) = M_0(F)/<-1>$, where $M_0(F)$ denotes the loop, consisting from elements of all matrix Cayley-Dickson algebra $C(F)$ with norm 1, and $F$ be a subfield of…

We prove that the unipotent horocyclic group of a Moufang twin tree of prime order is nilpotent of class at most 2.

The various finiteness conditions in commutative Moufang loops are characterized using the notions of centralizer of subloops and centralizer of subgroups of its multiplication group.

We find a short equational basis for the variety of $3$-supernilpotent loops. We also present a conceptually simple proof that $k$-nilpotence and $k$-supernilpotence are equivalent for groups. Connections between $3$-supernilpotent loops,…

We give a framework to describe gauge theory in which a nonassociative Moufang loop takes the place of the structure group. The structure of such gauge theory has many formal similarities with that of Yang-Mills theory. We extend the gauge…

For every octonion division algebra O, there exists a projective plane which is parametrized by O; these planes are related to rank two forms of linear algebraic groups of absolute type E6. We study all possible polarities of such octonion…

We study conjugacy closed loops (CC-loops) and power-associative CC-loops (PACC-loops). If $Q$ is a PACC-loop with nucleus $N$, then $Q/N$ is an abelian group of exponent 12; if in addition $Q$ is finite, then $|Q|$ is divisible by 16 or by…

A loop whose inner mappings are automorphisms is an \emph{automorphic loop} (or \emph{A-loop}). We characterize commutative (A-)loops with middle nucleus of index 2 and solve the isomorphism problem. Using this characterization and certain…

Using groups with triality we obtain some general multiplication formulas in Moufang loops, construct Moufang extensions of abelian groups, and describe the structure of minimal extensions for finite simple Moufang loops over abelian…

Let a Moufang loop Q contain a non-unitary subloop, which is a simple loop. Then Q is not embedded into a loop of invertible elements of any alternative algebra.

We prove a non-associative analog to the well-known $\frac{5}{8}$ Theorem. Namely, for a finite Moufang loop with nuclear commutators, we show that if the probability that three randomly chosen elements associate is greater than…

An A-loop is a loop in which every inner mapping is an automorphism. We settle a problem which had been open since 1956 by showing that every diassociative A-loop is Moufang.

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.