Related papers: Resolutions of square-free monomial ideals via fac…
We define the uniform face ideal of a simplicial complex with respect to an ordered proper vertex colouring of the complex. This ideal is a monomial ideal which is generally not squarefree. We show that such a monomial ideal has a linear…
In this paper we study simplicial complexes as higher dimensional graphs in order to produce algebraic statements about their facet ideals. We introduce a large class of square-free monomial ideals with Cohen-Macaulay quotients, and a…
In this paper we study squarefree monomial ideals which have constant depth functions. Edge ideals, matroidal ideals and facet ideals of pure simplicial forests connected in codimension one with this property are classified.
Given a square-free monomial ideal $I$, we define a simplicial complex labeled by the generators of $I^2$ which supports a free resolution of $I^2$. As a consequence, we obtain (sharp) upper bounds on the Betti numbers of the second power…
We provide a new combinatorial approach to study the minimal free resolutions of edge ideals, that is, quadratic square-free monomial ideals. With this method we can recover most of the known results on resolutions of edge ideals with…
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…
We study monomial ideals with linear presentation or partially linear resolution. We give combinatorial characterizations of linear presentation for square-free ideals of degree 3, and for primary ideals whose resolutions are linear except…
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…
It is known that the chain complex of a simplex on $q$ vertices can be used to construct a free resolution of any ideal generated by $q$ monomials, and as a direct result, the Betti numbers always have binomial upper bounds, given by the…
An explicit construction is given of a minimal free resolution of the ideal generated by all squarefree monomials of a given degree. The construction relies upon and exhibits the natural action of the symmetric group on the syzygy modules.…
We introduce a squarefree monomial ideal associated to the set of domino tilings of a $2\times n$ rectangle and proceed to study the associated minimal free resolution. In this paper, we use results of Dalili and Kummini to show that the…
We show that the number of elements generating a squarefree monomial ideal up to radical can always be bounded above in terms of the number of its minimal monomial generators and the maximal height of its minimal primes.
We construct the minimal resolutions of three classes of monomial ideals: dominant, 1-semidominant, and 2-semidominant ideals. The families of dominant and 1-semidominant ideals extend those of complete and almost complete intersections. We…
We consider ideals generated by general sets of $m$-minors of an $m\times n$-matrix of indeterminates. The generators are identified with the facets of an $(m-1)$-dimensional pure simplicial complex. The ideal generated by the minors…
Let $I$ be a square-free monomial ideal $I$ of projective dimension one. Starting with the Taylor complex on the generators of $I^r$, we use Discrete Morse theory to describe a CW complex that supports a minimal free resolution of $I^r$. To…
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…
In this short note we prove that the projective dimension of a sequentially Cohen-Macaulay square-free monomial ideal is equal to the maximal height of its minimal primes (also known as the big height), or equivalently, the maximal…
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…
In this article, we study the squarefree powers of facet ideals associated with simplicial trees. Specifically, we examine the linearity of their minimal free resolution and their regularity. Additionally, we investigate when the first…
Given a simplicial complex we associate to it a squarefree monomial ideal which we call the face ideal of the simplicial complex, and show that it has linear quotients. It turns out that its Alexander dual is a whisker complex. We apply…