Related papers: D-loops

An algebraic process for the construction of an autotopism for a non-Steiner C-loop is described and this is demonstrated with an example using a known finite C-loop. In every C-loop, two of its parastrophes are not equivalent(equal) it, if…

Given an oriented graph $D$, the inversion of a subset $X$ of vertices consists in reversing the orientation of all arcs with both endpoints in $X$. When the subset $X$ is of size $p$ (resp. at most $p$), this operation is called an…

Minimum distance diagrams are a way to encode the diameter and routing information of multi-loop networks. For the widely studied case of double-loop networks, it is known that each network has at most two such diagrams and that they have a…

The NAFIL is a finite loop in which every element has a unique (two-sided)inverse. NAFIL loops can be classified into two types: composite (with at least one non-trivial subsystem) and non-composite or plain (without any non-trivial…

Loops are subgraphs responsible for the multiplicity of paths going from one to another generic node in a given network. In this paper we present an analytic approach for the evaluation of the average number of loops in random scale-free…

We prove that any topological loop homeomorphic to a sphere or to a real projective space and having a compact-free Lie group as the inner mapping group is homeomorphic to the circle. Moreover, we classify the differentiable $1$-dimensional…

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…

Let $G$ be a finite group and $H$ a subgroup of $G$. Each left transversal (with identity) of $H$ in $G$ has a left loop (left quasigroup with identity) structure induced by the binary operation of $G$. We say two left transversals are…

Let $k$ be an algebraically closed field of characteristic $p>0$. Let $D$ be a $p$-divisible group over $k$. Let $n_D$ be the smallest non-negative integer for which the following statement holds: if $C$ is a $p$-divisible group over $k$ of…

Starting from the classification of real Manin triples done in a previous paper we look for those that are isomorphic as 6-dimensional Lie algebras with the ad-invariant form used for construction of the Manin triples. We use several…

We introduce new methods in pseudo-isotopy and embedding space theory. As an application we introduce an invariant that detects nontrivial loops of embedded 2-spheres in $S^{2} \times S^{2}$ and in connected sums of $S^{2} \times S^{2}$.…

The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…

The existence of A$_\rho$-loops, A$_\lambda$-loops and A$_\mu$-loops that are neither extra loops nor CC-loops such that any two of their inner mappings $R(x,y),L(x,y)$ and $T(x)$ commute while the other one is of order 2 is shown.

We develop a basic theory for divisible design graphs with possible selfloops (LDDG's), and describe two infinite families of such graphs, some members of which are also classical examples of divisible design graphs without loops (DDG's).…

Let $P$ be a set of $n \geq 5$ points in convex position in the plane. The path graph $G(P)$ of $P$ is an abstract graph whose vertices are non-crossing spanning paths of $P$, such that two paths are adjacent if one can be obtained from the…

We describe the structure of the algebraic group of automorphisms of all simple finite dimensional Lie superalgebras. Using this and \'etale cohomology considerations, we list all different isomorphism classes of the corresponding twisted…

Given any digraph $D$ without loops or multiple arcs, there is a natural construction of a semigroup $\langle D\rangle$ of transformations. To every arc $(a,b)$ of $D$ is associated the idempotent transformation $(a\to b)$ mapping $a$ to…

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…

The dicycle transversal number t(D) of a digraph D is the minimum size of a dicycle transversal of D, i. e. a set T of vertices of D such that D-T is acyclic. We study the following problem: Given a digraph D, decide if there is a dicycle B…

A periodic graph in dimension $d$ is a directed graph with a free action of $\Z^d$ with only finitely many orbits. It can conveniently be represented in terms of an associated finite graph with weights in $\Z^d$, corresponding to a…