相关论文: Toward the classification of Moufang loops of orde…

We classify Moufang loops of order 64 and 81 up to isomorphism, using a linear algebraic approach to central loop extensions. In addition to the 267 groups of order 64, there are 4262 nonassociative Moufang loops of order 64. In addition to…

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…

Let $G$ be a finite group and $C_2$ the cyclic group of order 2. Consider the 8 multiplicative operations $(x,y)\mapsto (x^iy^j)^k$, where $i$, $j$, $k\in\{-1, 1\}$. Define a new multiplication on $G\times C_2$ by assigning one of the above…

Two constructions due to Dr\'apal produce a group by modifying exactly one quarter of the Cayley table of another group. We present these constructions in a compact way, and generalize them to Moufang loops, using loop extensions. Both…

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…

An open problem in theory of loops is to find the variety of non- Moufang loops satisfying the Moufang Theorem. In this note, we present a variety of local smooth diassociative loops with such property.

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…

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…

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…

We use groups with triality to construct a series of nonassociative Moufang loops. Certain members of this series contain an abelian normal subloop with the corresponding quotient being a cyclic group. In particular, we give a new series of…

We introduce a class of non-Moufang loops satisfying the Moufang's theorem.

Code loops are Moufang loops constructed from doubly even binary codes. Then, given a code loop L, we ask which doubly even binary code V produces L. In this sense, V is called a representation of L. In this article we define and determine…

Code loops are Moufang loops constructed from doubly even binary codes. Then, given a code loop $L$, we ask which doubly even binary code $V$ produces $L$. In this sense, $V$ is called a representation of $L$. In this article we define and…

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…

We derive presentations for Moufang loops of type $M(G,2)$, defined by Chein, with $G$ finite, two-generated. We then use $G=S_3$ to visualize the smallest non-associative Moufang loop.

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.

A loop is (right) automorphic if all its (right) inner mappings are automorphisms. Using the classification of primitive groups of small degrees, we show that there is no nonassociative simple commutative automorphic loop of order less than…

The Moufang loop named for Richard Parker is a central extension of the extended binary Golay code. It the prototypical example of a general class of nonassociative structures known today as code loops, which have been studied from a number…

In this paper the linear representations of analytic Moufang loops are investigated. We prove that every representation of semisimple analytic Moufang loop is completely reducible and find all nonassociative irreducible representations. We…

For most (and possibly all) non-associative finite simple Moufang loops, three generators of order 3 can be chosen so that each two of them generate a group isomorphic to $(3, 3 | 3, p)$. The subgroup structure of $(3, 3 | 3, p)$ depends on…