In this paper we describe three different variations of prime ideals: strongly irreducible ideals, ideals and insulated in the context Leavitt path algebras. We give necessary sufficient conditions under which a proper ideal algebra L is product as well an intersection finitely many these types ideals. Such factorizations, when they are irredundant, shown to be unique except for order factors. ...

Let $R$ be a commutative ring and $I$ an ideal of $R$. The zero-divisor graph of $R$ with respect to $I$, denoted by $Gamma_I(R)$, is the simple graph whose vertex set is ${x in Rsetminus I mid xy in I$, for some $y in Rsetminus I}$, with two distinct vertices $x$ and $y$ are adjacent if and only if $xy in I$. In this paper, we state a relation between zero-divisor graph of $R$ with respec...

We present a (random) polynomial-time algorithm to generate a randomGaussian integer with the uniform distribution among those with norm at most N , along with its prime factorization. The method generalizes to finding a random ideal in the ring of integers of a quadratic number field together with its prime ideal factorization. We also discuss the analogous problem for higher degree number fie...

It is shown that a squarefree principal Borel ideal satisfies the persistence property for the associated prime ideals. For the graded maximal ideal we compute the index of stability with respect to squarefree principal Borel ideals and determine their stable set of associated prime ideals.

For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or antichains. This allows us to prove some consequences of the Boolean Prime Ideal theorem using arguments in the style of those that use Zorn’s Lemma, or Martin’s Axiom.

We introduce compactness theorems for generalized colorings and derive several particular compactness theorems from them. It is proved that the theorems and many of their consequences are equivalent in ZF set theory to BPI, the Prime Ideal Theorem for Boolean algebras. keywords: generalized graph colorings, compactness, prime ideal theorem MSC: 05C15; 03E25 .

Finding the key of symmetric cipher takes computing common zero of polynomials, which de ne ideal and corresponding variety, usually considered over algebraically closed eld. The solution is the point of the variety over prime eld; it is de ned by a sum of the polynomial ideal and the eld ideal that de nes prime eld. Some authors use partitioning of this sum and reducing syzygies of polynomial ...

In this paper, binomial difference ideals are studied. Three canonical representations for Laurent binomial difference ideals are given in terms of the reduced Gröbner basis of Z[x]-lattices, regular and coherent difference ascending chains, and partial characters over Z[x]-lattices, respectively. Criteria for a Laurent binomial difference ideal to be reflexive, prime, well-mixed, and perfect a...

Department of Mathematics, Jadavpur University Kolkata-700032, India manasi−[email protected] Abstract The notion of intuitionistic fuzzy set was introduced by Atanassov as a generalization of the notion of fuzzy set. In this paper we apply this concept of Atanassov to ideals, prime ideals and semiprime ideals of Γsemigroups in order to obtain some characterization theorems. We also introduce the not...