Related papers: Smarandache Loops
For sufficiently nice families of semigroups and monoids, the structure theorem for sets of length states that the length set of any sufficiently large element is an arithmetic sequence with some values omitted near the ends. In this paper,…
Let $R$ be a commutative ring with a non-zero identity, $S$ be a multiplicatively closed subset of $R$ and $M$ be a unital $R$-module. In this paper, we define a submodule $N$ of $M$ with $(N:_{R}M)\cap S=\phi$ to be weakly $S$-prime if…
In the field of mathematics, a purely combinatorial equivalent to a simplicial complex, or more generally, a down-set, is an abstract structure known as a family of sets. This family is closed under the operation of taking subsets, meaning…
Finite groups are of the greatest importance in science. Loops are a simple generalization of finite groups: they share all the group axioms except for the requirement that the binary operation be associative. The least loops that are not…
Let $X$ be a separable nonquasireflexive Banach space. Let $Y$ be a Banach space isomorphic to a subspace of $X^*$. The paper is devoted to the following questions: 1. Under what conditions does there exist an isomorphic embedding $T:Y\to…
Living organisms interact with their surroundings in a closed-loop fashion, where sensory inputs dictate the initiation and termination of behaviours. Even simple animals are able to develop and execute complex plans, which has not yet been…
Linking systems were introduced to provide algebraic models for $p$-completed classifying spaces of fusion systems. Every linking system over a saturated fusion system $\mathcal{F}$ corresponds to a group-like structure called a locality.…
We generalize the construction of multitildes in the aim to provide multitilde operators for regular languages. We show that the underliying algebraic structure involves the action of some operads. An operad is an algebraic structure that…
We demonstrate that a single sub-cycle optical pulse can be generated when a pulse with a few optical cycles penetrates through resonant two-level dense media with a subwavelength structure. The single-cycle gap soliton phenomenon in the…
A clone on a set X is a set of finitary operations on X which contains all the projections and is closed under composition. The set of all clones forms a complete lattice Cl(X) with greatest element O, the set of all finitary operations.…
We introduce and discuss the concept of modular entanglement. This is the entanglement that is established between the end points of modular systems composed by sets of interacting moduli of arbitrarily fixed size. We show that end-to-end…
A flip-swap language is a set S of binary strings of length n such that $S \cup 0^n$ is closed under two operations (when applicable): (1) Flip the leftmost 1; and (2) Swap the leftmost 1 with the bit to its right. Flip-swap languages model…
A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable existentially closed semilinear order, which…
M.S. Rao recently investigated some sorts of special filters in distributive pseudocomplemented lattices. In our paper we extend this study to lattices which need neither be distributive nor pseudocomplemented. For this sake we define a…
The question What is Complexity? has occupied a great deal of time and paper over the last 20 or so years. There are a myriad different perspectives and definitions but still no consensus. In this paper I take a phenomenological approach,…
Let R be a commutative ring with identity, S be a multiplicatively closed subset of R, and let M be an R-module. The aim of this paper is to introduce the notion of S-secondary submodules of M as a generalization of secondary submodules of…
We consider different generalizations of the honeycomb lattice to three dimensional structures. We address the family of the hyper-honeycomb lattice, which is made up of alternating layers of 2D honeycomb nano-ribbons, with each layer…
By a 2-group we mean a groupoid equipped with a weakened group structure. It is called split when it is equivalent to the semidirect product of a discrete 2-group and a one-object 2-group. By a permutation 2-group we mean the 2-group…
In this paper we compute the loop homology of bi-secondary structures. Bi-secondary structures were introduced by Haslinger and Stadler and are pairs of RNA secondary structures, i.e. diagrams having non-crossing arcs in the upper…
A 2-group is a `categorified' version of a group, in which the underlying set G has been replaced by a category and the multiplication map m: G x G -> G has been replaced by a functor. A number of precise definitions of this notion have…