For an ideal or K-subalgebra E of K[X1, . . . , Xn], consider subfields k ⊂ K, where E is generated – as ideal or K-subalgebra – by polynomials in k[X1, . . . , Xn]. It is a standard result for ideals that there is a smallest such k. We give an algorithm to find it. We also prove that there is a smallest such k for K-subalgebras. The ideal results use reduced Gröbner bases. For the subalgebra r...

In this paper, T. K. Dutta`s and S. K. Sardar`s semiprime ideal of -rings as a fuzzy semiprime ideal of a -rings via its operator rings was defined. Some characterizations of fuzzy semiprime ideal of -rings was obtained. That is; a characterization prove of a fuzzy semiprime ideal, the relationship between fuzzy semiprime ideal and fuzzy prime ideal was obtained. If is fuzzy semiprime ideal of ...

Local consistency techniques such as k-consistency are a key component of specialised solvers for constraint satisfaction problems. In this paper we show that the power of using k-consistency techniques on a constraint satisfaction problem is precisely captured by using a particular inference rule, which we call negative-hyper-resolution, on the standard direct encoding of the problem into Bool...

In this paper, we give an important isomorphism between contacyclic codes and cyclic codes,over finite principal ideal rings.Necessary and sufficient conditions for the existence of non-trivial cyclic self-dual codes over finite principal ideal rings are given.

Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...

We introduce a method of searching the k nearest neighbours (k-NN) using PM-tree. The PM-tree is a metric access method for similarity search in large multimedia databases. As an extension of M-tree, the structure of PM-tree exploits local dynamic pivots (like M-tree does it) as well as global static pivots (used by LAESA-like methods). While in M-tree a metric region is represented by a hyper-...

Let X be a k-vector space, and U a maximal proper filter of subspaces of X. Then the ring of endomorphisms of X that are ‘‘continuous’’ with respect to U modulo the ideal of those that are ‘‘trivial’’ with respect to U forms a division ring E(U ). (These division rings can also be described as the endomorphism rings of the simple left End( X )-modules.) We study this and the dual construction, ...

Let A be a Banach algebra. Then A the second dual of A is a Banach algebra with first (second) Arens product. We study the Arens products of A(= (A∗∗)∗∗). We fined some conditions on A to be a left ideal in A. We fined the biggest two sided ideal I of A, in which I is a left (right) ideal of A∗∗.