Related papers: Building monomial ideals with fixed betti numbers
Monomial ideals which are generic with respect to either their generators or irreducible components have minimal free resolutions derived from simplicial complexes. For a generic monomial ideal, the associated primes satisfy a saturated…
Independent sets play a key role into the study of graphs and important problems arising in graph theory reduce to them. We define the monomial ideal of independent sets associated to a finite simple graph and describe its homological and…
We provide an algorithm that computes a set of generators for any complete ideal in a smooth complex surface. More interestingly, these generators admit a presentation as monomials in a set of maximal contact elements associated to the…
We compute the Betti numbers of the resolution of a special class of square-free monomial ideals, the ideals of mixed products. Moreover when these ideals are Cohen-Macaulay we calculate their type.
Let M in k[x,y] be a monomial ideal M=(m_1,m_2,...,m_r), where the m_i are a minimal generating set of M. We construct an explicit free resolution of k over S=k[x,y]/M for all monomial ideals M, and provide recursive formulas for the Betti…
Call a monomial ideal M "generic" if no variable appears with the same nonzero exponent in two distinct monomial generators. Using a convex polytope first studied by Scarf, we obtain a minimal free resolution of M. Any monomial ideal M can…
Let $K$ be a field, $V$ a $K$-vector space with basis $e_1,\ldots,e_n$, and $E$ the exterior algebra of $V$. To a given monomial ideal $I\subsetneq E$ we associate a special monomial ideal $J$ with generators in the same degrees as those of…
We describe the typical homological properties of monomial ideals defined by random generating sets. We show that, under mild assumptions, random monomial ideals (RMI's) will almost always have resolutions of maximal length; that is, the…
In this paper we investigate the class of rigid monomial ideals. We give a characterization of the minimal free resolutions of certain classes of these ideals. Specifically, we show that the ideals in a particular subclass of rigid monomial…
We express the multigraded Betti numbers of an arbitrary monomial ideal in terms of the multigraded Betti numbers of two basic classes of ideals. This decompo- sition has multiple applications. In some concrete cases, we use it to construct…
We provide some new conditions under which the graded Betti numbers of a monomial ideal can be computed in terms of the graded Betti numbers of smaller ideals, thus complementing Eliahou and Kervaire's splitting approach. As applications,…
The Taylor resolution is almost never minimal for powers of monomial ideals, even in the square-free case. In this paper we introduce a smaller resolution for each power of any square-free monomial ideal, which depends only on the number of…
Let $R = k[x_1, \dotsc , x_n]$ denote the standard graded polynomial ring over a field $k$. We study certain classes of equigenerated monomial ideals with the property that the so-called complementary ideal has no linear relations on the…
Let $R=K[x_1,\ldots, x_n]$ be the polynomial ring in $n$ variables over a field $K$ and let $I$ be a monomial ideal of $R$. In this paper, we present an explicit formula for the Betti numbers of almost complete intersection monomial ideals,…
We present two new problems on lower bounds for resolution Betti numbers of monomial ideals generated in a fixed degree. The first concerns any such ideal and bounds the total Betti numbers, while the second concerns ideals that are…
We consider the fiber cone of monomial ideals. It is shown that for monomial ideals $I\subset K[x,y]$ of height $2$, generated by $3$ elements, the fiber cone $F(I)$ of $I$ is a hypersurface ring, and that $F(I)$ has positive depth for…
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$.…
Inspired by the study of random graphs and simplicial complexes, and motivated by the need to understand average behavior of ideals, we propose and study probabilistic models of random monomial ideals. We prove theorems about the…
The paper presents two algorithms for finding irreducible decomposition of monomial ideals. The first one is recursive, derived from staircase structures of monomial ideals. This algorithm has a good performance for highly non-generic…
Let $S=\mathbb{K}[x_1,\ldots,x_n]$ the polynomial ring over a field $\mathbb{K}$. In this paper for some families of monomial ideals $I \subset S$ we study the minimal number of generators of $I^k$. We use this results to find some other…