Related papers: Construction of groups with triality and their cor…

Code loops were introduced by R. L. Griess. R.L. Griess and T. Hsu gave methods to construct the corresponding code loop from any given doubly even binary code; both these methods used some kind of induction. In this paper, we present a…

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.

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…

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…

Nonassociative finite simple Moufang loops are exactly the loops constructed by Paige from Zorn vector matrix algebras. We prove this result anew, using geometric loop theory. In order to make the paper accessible to a broader audience, we…

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…

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…

Let $G$ be a finite group and let $p$ be a prime. We continue the search for generic constructions of free products and free monoids in the unit group $\mathcal{U}(\mathbb{Z}G)$ of the integral group ring $\mathbb{Z}G$. For a nilpotent…

Moufang loops are one of the best-known generalizations of groups. There is only one countable family of nonassociative finite simple Moufang loops, arising from the split octonion algebras. We prove that every member of this family is…

It is well known that if a group G factorizes as G = NH where H\leq G and N is normal in G then the group structure of G is determined by the subgroups H and N, the intersection of N with H and how H acts on N with a homomorphism f : H ->…

We compute the orders of free commutative Moufand loops of exponent 3 with $n\leq 7$ free generators and find embeddings of such loops into a loop of invertible elements of the free commutative alternative algebra with identity $x^3=0$.

We investigate Moufang loops which can be written as the semidirect product of a loop and a group. We also examine a particular class of loop extensions which arise as a result of a finite cyclic group acting as a group of semiautomorphisms…

We present an elementary proof that the nonassociative simple Moufang loops over finite prime fields are generated by three elements. In the last section, we conclude that integral Cayley numbers of unit norm are generated multiplicatively…

Codes in the generalized quaternion group algebra $\mathbb{F}_q[Q_{4n}]$ are considered. Restricting to char$\mathbb{F}_q \nmid 4n$ the structure of an arbitrary code $C \subseteq \mathbb{F}_q[Q_{4n}]$ is described via the Wedderburn…

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,…

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…

We construct two infinite series of Moufang loops of exponent $3$ whose commutative center (i.e. the set of elements that commute with all elements of the loop) is not a normal subloop. In particular, we obtain examples of such loops of…

We study the two-sided Guionnet-Jones-Shlyakhtenko construction applied to the group planar algebra $P(\mathcal{G})$ of a finite non-trivial group $\mathcal{G}$. This produces a sequence of von Neumann algebras $M^k$ for $k \geq 0$ with no…

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…

In groups, an abelian normal subgroup induces an abelian congruence. We construct a class of centrally nilpotent Moufang loops containing an abelian normal subloop that does not induce an abelian congruence. On the other hand, we prove that…