Related papers: Infinite Simple Bol Loops

In this paper we investigate the Bol loops and connected with them groups. We prove an analog of the Doro's theorem for Moufang loops and find a criterion for simplicity of Bol loops. One of the main results obtained is the following: if…

In this paper we give an infinite class of finite simple right Bol loops of exponent 2. The right multiplication group of these loops is an extension of an elementary Abelian 2-group by $S_5$. The construction uses the description of the…

The existence of finite simple non-Moufang Bol loops was considered as one of the main open problems in the theory of loops and quasigroups. In this paper, we present a class of proper simple Bol loops. This class also contains finite and…

A Bol loop is a loop that satisfies the identity $x((yz)y)=((xy)z)y$. In this paper, we give a construction of the free Bol loops of exponent two. We define a canonical form of all their elements and describe their multiplication law based…

We partially answer two questions of Goodaire by showing that in a finite, strongly right alternative ring, the set of units (if the ring is with unity) is a Bol loop under ring multiplication, and the set of quasiregular elements is a Bol…

Although any finite Bol loop of odd prime exponent is solvable, we show there exist such Bol loops with trivial center. We also construct finitely generated, infinite, simple Bruck loops of odd prime exponent for sufficiently large primes.…

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 give a general construction for right conjugacy closed loops, using $GL(2,q)$ for $q$ a prime power. Under certain conditions, the loops constructed are simple, giving the first general construction for finite, simple right conjugacy…

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…

We determine a reasonable upper bound for the complexity of collection from the left to multiply two elements of a finite soluble, or polycyclic, group by restricting attention to certain polycyclic presentations of the group.

A left Bol loop is a loop satisfying $x(y(xz)) = (x(yx))z$. The commutant of a loop is the set of elements which commute with all elements of the loop. In a finite Bol loop of odd order or of order $2k$, $k$ odd, the commutant is a subloop.…

We show how to construct all the extensions of left braces by ideals with trivial structure. This is useful to find new examples of left braces. But, to do so, we must know the basic blocks for extensions: the left braces with no ideals…

A loop is shown to be a universal Osborn loop if and only if it has a particular simplicial complex. A loop is shown to be a universal Osborn loop and obeys two new identities if and only if it has another particular simplicial complex. A…

Using the relations between the theory of differentiable Bol loops and the theory of affine symmetric spaces we classify all connected differentiable Bol loops having an at most $9$-dimensional semi-simple Lie group as the group…

Suppose $G$ is a simple group. For any nontrivial elements $g$ and $h$, $g$ can be written as a finite product of conjugates of $h$ or the inverse of $h$. G is called uniformly simple if the length of such an expression is uniformly…

The notion of the holomorph of a generalized Bol loop and generalized flexible-Bol loop are characterized. With the aid of two self-mappings on the holomorph of a loop, it is shown that: the loop is a generalized Bol loop if and only if its…

We say that a loop is unbreakable when it does not have nontrivial subloops. While the cyclic groups of prime order are the only unbreakable finite groups, we show that nonassociative unbreakable loops exist for every order n >= 5. We…

The fundamental ideas of the definition of solvable and semisimple Bol algebras are given and some related theorems

In program semantics and verification, reasoning about loops is complicated by the need to produce two separate mathematical arguments: an invariant, for functional properties (ignoring termination); and a variant, for termination (ignoring…

A simple linear loop is a simple while loop with linear assignments and linear loop guards. If a simple linear loop has only two program variables, we give a complete algorithm for computing the set of all the inputs on which the loop does…