相关论文: On the stable set of associated prime ideals of a …

The associated prime ideals of powers of polymatroidal ideals are studied, including the stable set of associated prime ideals of this class of ideals. It is shown that polymatroidal ideals have the persistence property and for transversal…

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…

We explicitly determine the associated primes of every power of a complementary edge ideal, prove that they satisfy the persistence property, and compute the $\text{v}$-function. In the course of the proofs, we completely describe the…

Strongly stable monomial ideals are important in algebraic geometry, commutative algebra, and combinatorics. Prompted, for example, by combinatorial approaches for studying Hilbert schemes and the existence of maximal total Betti numbers…

We characterize monomial ideals which are intersections of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.

For arbitrary positive integers $q_1 \ge q_2 \ge q_3 \ge \cdots$ we construct a family of monomial ideals such that for each positive integer $e$ and for each ideal $I$ in the family, the number of associated primes of $I^e$ is the $q_e$.…

In this paper, we establish some criteria to detect the presence of the maximal ideal $(x_1, \ldots, x_n)$ in the set of associated primes of powers of monomial ideals in the polynomial ring $K[x_1, \ldots, x_n]$. Furthermore, for each of…

We determine, in a polynomial ring over a field, the arithmetical rank of certain ideals generated by a set of monomials and one binomial.

Let $I$ be a monomial ideal of a polynomial ring $R$. In this paper we determine a number $B$ such that $\Ass (I^n/I^{n+1}) = \Ass (I^{B}/I^{B+1})$ for all $n\geq B$.

We find an explicit expression of the associated primes of monomial ideals as a colon by an element $v$, using the unique irredundant irreducible decomposition whose irreducible components are monomial ideals (Theorem 3.1). An algorithm to…

We determine a new technique which allows the computation of the arithmetical rank of certain monomial ideals.

We study conditions on polynomials such that the ideal generated by their orbits under the symmetric group action becomes a monomial ideal or has a monomial radical. If the polynomials are homogeneous, we expect that such an ideal has a…

We study when Taylor resolutions of monomial ideals are minimal. We consider monomial ideals with linear quotients. In particular, we determine precisely the stable ideals and the monomial ideals with linear resolutions having the miminal…

For which monomial supports do most polynomials generate a prime ideal? We give necessary and sufficient conditions for the radical of the ideal to be prime over an algebraically closed field. In characteristic zero, the same conditions…

In this paper we develop a new technique to compute the Betti table of a monomial ideal. We present a prototype implementation of the resulting algorithm and we perform numerical experiments suggesting a very promising efficiency. On the…

We consider the problem of determining whether a set of primes, or, more generally, prime ideals in a number field, can be realized as a finite union of residue classes, or of Frobenius conjugacy classes. We give criteria for a set to be…

Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…

A sumset semigroup is a non-cancellative commutative monoid obtained from the sumset of finite non-negative integer sets. In this work, an algorithm for computing the ideals associated with some sumset semigroups is provided. Using these…

An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…

Let $I$ be a square-free monomial ideal in $R = k[x_1,\ldots,x_n]$, and consider the sets of associated primes ${\rm Ass}(I^s)$ for all integers $s \geq 1$. Although it is known that the sets of associated primes of powers of $I$ eventually…