This paper gives a complete primary decomposition of the rst, that is, the smallest, Mayr-Meyer ideal, its radical, and the intersection of its minimal components. The particular membership problem which makes the Mayr-Meyer ideals' complexity doubly exponential in the number of variables is here examined also for the radical and the intersection of the minimal components. It is proved that for...

We present two approaches to compute the (absolute) reduction number of a polynomial ideal. The first one puts the ideal into a position such that the reduction number of its leading ideal can be easily read off the minimal generators and then uses linear algebra to determine the reduction number of the ideal itself. The second method computes via a Gröbner system not only the absolute reductio...

An ideal I on a cardinal κ is called rigid if all automorphisms of P (κ)/I are trivial. An ideal is called μ-minimal if whenever G ⊆ P (κ)/I is generic and X ∈ P (μ)V [G] \ V , it follows that V [X] = V [G]. We prove that the existence of a rigid saturated μ-minimal ideal on μ+, where μ is a regular cardinal, is consistent relative to the existence of large cardinals. The existence of such an i...

In this paper, we define the notion of minimal prime ideals hoops and investigate some properties them. Then by using annihilators, study relation between annihilators. Also, introduce zero divisors elements prove that set all is a union hoop. Finally, notions maximal hoop, two new as p-ideal m-ideal. them every semi-simple hoop an m-ideal it.

Let I be a monomial squarefree ideal of a polynomial ring S over a field K such that the sum of every three different ideals of its minimal prime ideals is the maximal ideal of S, or more generally a constant ideal. We associate to I a graph on [s], s = |MinS/I|, on which we may read the depth of I. In particular, depthS I does not depend on char K. Also we show that I satisfies Stanley’s Conje...

We study minimal free resolutions of edge ideals of bipartite graphs. We associate a directed graph to a bipartite graph whose edge ideal is unmixed, and give expressions for the regularity and the depth of the edge ideal in terms of invariants of the directed graph. For some classes of unmixed edge ideals, we show that the arithmetic rank of the ideal equals projective dimension of its quotient.

Gu map-1 is a modified version of GGH map. It uses same ideal lattices for constructing the trapdoors, while the novelty is that no encodings of zero are given. In this short paper we show that Gu map-1 cannot be used for the instance of witness encryption (WE) based on the hardness of 3-exact cover problem. That is, if Gu map-1 is used for such instance, we can break it by soving a combined 3-...

This paper gives a complete primary decomposition of the first, that is, the smallest, Mayr-Meyer ideal, its radical, and the intersection of its minimal components. The particular membership problem which makes the Mayr-Meyer ideals’ complexity doubly exponential in the number of variables is here examined also for the radical and the intersection of the minimal components. It is proved that f...

In this paper, by a modification of a previously constructed minimal free resolution for a transversal monomial ideal, the Betti numbers of this ideal is explicitly computed. For convenient characteristics of the ground field, up to a change of coordinates, the ideal of t-minors of a generic pluri-circulant matrix is a transversal monomial ideal . Using a Gröbner basis for this ideal, it is sho...