Related papers: Smarandache Loops
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.…
Modular structure is pervasive in many complex networks of interactions observed in natural, social and technological sciences. Its study sheds light on the relation between the structure and function of complex systems. Generally speaking,…
Groups with a large $p$-subgroup, $p$ a prime, include almost all of the groups of Lie type in characteristic $p$ and so the study of such groups adds to our understanding of the finite simple groups. In this article we study a special…
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…
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…
In this paper we introduce novel views of monoids and groups. More specifically, for a given set $S$, let $S^{S\times S}$ be the set of binary operations on $S$. We equip $S^{S\times S}$ with canonical binary operations induced by the…
A Smarandache quasigroup(loop) is shown to be universal if all its f,g-principal isotopes are Smarandache f,g-principal isotopes. Also, weak Smarandache loops of Bol-Moufang type such as Smarandache: left(right) Bol, Moufang and extra loops…
A subset $U$ of a set $S$ with a binary operation is called {\it avoidable} if $S$ can be partitioned into two subsets $A$ and $B$ such that no element of $U$ can be written as a product of two distinct elements of $A$ or as the product of…
The purposes of this paper are to classify lower triangular forms and to determine under what conditions a nonlinear system is equivalent to a specific type of lower triangular forms. According to the least multi-indices and the greatest…
Techniques to achieve various forms of test coverage, such as branch coverage, typically do not iterate loops; in other words, they treat a loop as a conditional, executed zero or one time. Existing work by the author and collaborators…
There is a family of constructions to produce orthomodular structures from modular lattices, lattices that are M and M*-symmetric, relation algebras, the idempotents of a ring, the direct product decompositions of a set or group or…
A dilatation structure is a concept in between a group and a differential structure. In this article we study fundamental properties of dilatation structures on metric spaces. This is a part of a series of papers which show that such a…
Let $\cF$ be a family of finite loops closed under subloops and factor loops. Then every loop in $\cF$ has the strong Lagrange property if and only if every simple loop in $\cF$ has the weak Lagrange property. We exhibit several such…
A rope is a non-singular embedding of a closed interval into R^3, which sends the ends of the interval to some fixed points A and B such that |AB|=1. A rope is short if its length is less than 3. The main result of the paper is that the…
There are continuum many clones on a three-element set even if they are considered up to \emph{homomorphic equivalence}. The clones we use to prove this fact are clones consisting of \emph{self-dual operations}, i.e., operations that…
We use the Maple system to check the investigations of S. S. Gupta regarding the Smarandache consecutive and the reversed Smarandache sequences of triangular numbers [Smarandache Notions Journal, Vol. 14, 2004, pp. 366-368]. Furthermore, we…
Dictionaries are inherently circular in nature. A given word is linked to a set of alternative words (the definition) which in turn point to further descendants. Iterating through definitions in this way, one typically finds that…
We define a quasimodule Q over a bounded lattice L in an analogous way as a module over a semiring is defined. The essential difference is that L need not be distributive. Also for quasimodules there can be introduced the concepts of inner…
Combinatorics, like computer science, often has to deal with large objects of unspecified (or unusable) structure. One powerful way to deal with such an arbitrary object is to decompose it into more usable components. In particular, it has…
We consider the general problem of constructing the structure of a smooth manifold on a given space of loops in a smooth finite dimensional manifold. By generalising the standard construction for smooth loops, we derive a list of conditions…