in the transformation semigroup (x, s) we introduce the height of a closed nonempty invariant subset of x, define the transformed dimension of nonempty subset s of x and obtain some results and relations.

Let $R$ be an infinite ring. Here we prove that if $0_R$ belongs to ${x_1x_2cdots x_n ;|; x_1,x_2,dots,x_nin X}$ for every infinite subset $X$ of $R$, then $R$ satisfies the polynomial identity $x^n=0$. Also we prove that if $0_R$ belongs to ${x_1x_2cdots x_n-x_{n+1} ;|; x_1,x_2,dots,x_n,x_{n+1}in X}$ for every infinite subset $X$ of $R$, then $x^n=x$ for all $xin R$.

Subset Interconnection Design is an NP −hard problem which draws its motivation from various applications, such as the design of scalable overlay networks, the inference of inter-molecular protein connectivity, the design of vacuum systems and several other problems in the industry. In that problem, we are given a set of vertices V and a collection S of subsets of V and we want to find an edge ...

In the field of algorithmic analysis, one of the more well-known exercises is the subset sum problem. That is, given a set of integers, determine whether one or more integers in the set can sum to a target value. Aside from the brute-force approach of verifying all combinations of integers, several solutions have been found, ranging from clever uses of various data structures to computationally...

Many a time, items can be classified as defective or non-defective and the objective is to identify all items, if any, in population. The concept of group testing deals with identifying such using minimum number tests. This paper proposes probabilistic through subset intersection strategy. proposed algorithm 'Subset Intersection Group Testing Strategy' dividing whole population, it positive, in...