In this article‎, ‎we have characterized ideals in $C(X)$ in which‎ ‎every ideal is also an ideal (a $z$-ideal) of $C(X)$‎. ‎Motivated by‎ ‎this characterization‎, ‎we observe that $C_infty(X)$ is a regular‎ ‎ring if and only if every open locally compact $sigma$-compact‎ ‎subset of $X$ is finite‎. ‎Concerning prime ideals‎, ‎it is shown that‎ ‎the sum of every two prime (semiprime) ideals of e...

Let L be the generalized mixed product ideal induced by a monomial ideal I. In this paper we compute powers of the genearlized mixed product ideals and show that Lk  have a linear resolution if and only if Ik have a linear resolution for all k. We also introduce the generalized mixed polymatroidal ideals and prove that powers and monomial localizations of a generalized mixed polymatroidal ideal...

It is well-known that the sum of two $z$-ideals in $C(X)$ is either $C(X)$ or a $z$-ideal. The main aim of this paper is to study the sum of strongly $z$-ideals in ${mathcal{R}} L$, the ring of real-valued continuous functions on a frame $L$. For every ideal $I$ in ${mathcal{R}} L$, we introduce the biggest strongly $z$-ideal included in $I$ and the smallest strongly $z$-ideal containing ...

The security of many efficient cryptographic constructions, e.g. collision-resistant hash functions, digital signatures, identification schemes, and more recently public-key encryption has been proven assuming the hardness of worst-case computational problems in ideal lattices. These lattices correspond to ideals in the ring Z[ζ], where ζ is some fixed algebraic integer. Under the assumption th...

The mathematical construction of ideal quilts is outlined and a relationship of ideal quilts with certain ideas in modern arts centered on the grammar of abstraction is explored.

The question of how to combine monads arises naturally in many areas with much recent interest focusing on the coproduct of two monads. In general, the coproduct of arbitrary monads does not always exist. Although a rather general construction was given by Kelly [15], its generality is reflected in its complexity which limits the applicability of this construction. Following our own research [1...

Micciancio defined a generalization of cyclic lattices, called ideal lattices. These lattices can be used in cryptosystems to decrease the number of parameters necessary to describe a lattice by a square root, making them more efficient. He proves that the computational intractability of classic lattice problems for these lattices gives rise to provably secure one-way and collision-resistant ha...

the concept of right (left) quotient (or residual) of an ideal η by anideal ν of an l-subring μ of a ring r is introduced. the right (left) quotients areshown to be ideals of μ . it is proved that the right quotient [η :r ν ] of an idealη by an ideal ν of an l-subring μ is the largest ideal of μ such that[η :r ν ]ν ⊆ η . most of the results pertaining to the notion of quotients(or residual) of ...