Related papers: Specializations of Ferrers ideals
Minimal free resolutions of graded modules over a noetherian polynomial ring have been attractive objects of interest for more than a hundred years. We introduce and study two natural extensions in the setting of graded modules over a…
We derive two general bounds for the depths of powers of squarefree monomial ideals corresponding to hyperforests. These bounds generalize known bounds for the depths of squarefree monomial ideals, which were given in terms of the edgewise…
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…
A graph-theoretic method, simpler than existing ones, is used to characterize the minimal set of monomial generators for the integral closure of any algebra of polynomials generated by quadratic monomials. The toric ideal of relations…
Let $I$ be a monomial ideal in two variables generated by three monomials and let $\mathcal{R}(I)$ be its Rees ideal. We describe an algorithm to compute the minimal generating set of $\mathcal{R}(I)$. Based on the data obtained by this…
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…
We show that for every positive integer R there exist monomial ideals generated in degree two, with linear syzygies, and regularity of the quotient equal to R. Such examples can not be found among Gorenstein ideals since the regularity of…
We study the defining equations of the Rees algebra of square-free monomial ideals in a polynomial ring over a field. We determine that when an ideal $I$ is generated by $n$ square-free monomials of the same degree then $I$ has relation…
The question we address in this paper is: which monomial ideals have minimal cellular resolutions, that is, minimal resolutions obtained from homogenizing the chain maps of CW-complexes? Velasco gave families of examples of monomial ideals…
We prove a sufficient and a necessary condition for a square-free monomial ideal $J$ associated to a (dual) hypergraph to have projective dimension equal to the minimal number of generators of $J$ minus 2. We also provide an effective…
In a 2008 paper, the first author and Van Tuyl proved that the regularity of the edge ideal of a graph G is at most one greater than the matching number of G. In this note, we provide a generalization of this result to any square-free…
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…
In this paper, we introduce and study families of squarefree monomial ideals called clique ideals and independence ideals that can be associated to a finite graph. A family of clique ideals with linear resolutions has been characterized.…
Using discrete Morse theory, we give an algorithm that prunes the excess of information in the Taylor resolution and constructs a new cellular free resolution for an arbitrary monomial ideal. The pruned resolution is not simplicial in…
We prove that monomial ideals with at most five generators and their Artinian reductions have minimal generalized Barile-Macchia resolutions. As a corollary, these ideals have minimal cellular resolutions, extending a result by Faridi, D.G,…
A celebrated theorem of Fr\"oberg gives a complete combinatorial classification of quadratic square-free monomial ideals with a linear resolution. A generalization of this theorem to higher degree square-free monomial ideals is an active…
Strongly stable ideals are a class of monomial ideals which correspond to generic initial ideals in characteristic zero and can be described completely by their Borel generators, a subset of the minimal monomial generators of the ideal.…
There are many connections between the invariants of the different powers of an ideal. We investigate how to construct minimal resolutions for all powers at once using methods from algebraic and polyhedral topology with a focus on ideals…
Two generating sets of the defining ideal of a Nichols algebra of diagonal type are proposed, which are then applied to study the bar involution and the specialization problem of quantum groups associated to non-symmetrizable generalized…
We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity. Also, we show that the binomial edge ideal of a block graph…