相关论文: Monomial ideals with linear quotients whose Taylor…
In this paper we give a necessary and sufficient combinatorial condition for a monomial ideal to have a linear resolution over fields of characteristic 2. We also give a new proof of Fr\"oberg's theorem over fields of characteristic 2.
Given a monomial ideal in a polynomial ring over a field, we define the generalized Newton complementary dual of the given ideal. We show good properties of such duals including linear quotients and isomorphisms between the special fiber…
In this paper we investigate the question of normality for special monomial ideals in a polynomial ring over a field. We first include some expository sections that give the basics on the integral closure of a ideal, the Rees algebra on an…
We introduce a construction, called linearization, that associates to any monomial ideal $I$ an ideal $\mathrm{Lin}(I)$ in a larger polynomial ring. The main feature of this construction is that the new ideal $\mathrm{Lin}(I)$ has linear…
In this paper, we study ideals $I$ whose linear strand can be supported on a regular CW complex. We provide a sufficient condition for the linear strand of an arbitrary subideal of $I$ to remain supported on an easily described subcomplex.…
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…
Let $I$ be a graded ideal of $K[x_1,\ldots,x_n]$ generated by homogeneous polynomials of a same degree $d$, and assume that $I$ has linear quotients. In this note, we use Horseshoe Lemma to give a relatively direct inductive construction of…
In this paper we study minimal free resolutions of some classes of monomial ideals. we first give a sufficient condition to check the minimality of the resolution obtained by the mapping cone. Using it, we obtain the Betti numbers of…
Scattered over the past few years have been several occurrences of simplicial complexes whose topological behavior characterize the Cohen-Macaulay property for quotients of polynomial rings by arbitrary (not necessarily squarefree) monomial…
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…
Let $K$ be a field of characteristic zero, let $I \subset S = K[x_1,\dots,x_n]$ be a homogeneous ideal, and let $\partial(I)$ be its gradient ideal. We study the relationship between $\mathrm{reg}\,I$ and $\mathrm{reg}\,\partial(I)$. While…
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 consider powers of lexsegment ideals with a linear resolution (equivalently, with linear quotients) which are not completely lexsegment ideals. We give a complete description of their minimal graded free resolution.
In this paper we develop a theory of monomial preorders, which differ from the classical notion of monomial orders in that they allow ties between monomials. Since for monomial preorders, the leading ideal is less degenerate than for…
We consider ideals in the ring $\mathbb{Z}_2[x_1,\ldots, x_n]$ that contain the polynomials $x_i^2 - x_i$ for $i = 1, \ldots, n$ and give various results related to the one-to-one correspondence between these ideals and the subsets of…
B. Sturmfels and S. Sullivant associated to any graph a toric ideal, called the cut ideal. We consider monomial cut ideals and we show that their algebraic properties such as the minimal primary decomposition, the property of having a…
We introduce the combinatorial Lyubeznik resolution of monomial ideals. We prove that this resolution is isomorphic to the usual Lyubezbnik resolution. As an application, we give a combinatorial method to determine if an ideal is a…
We introduce the class of lattice-linear monomial ideals and use the LCM-lattice to give an explicit construction for their minimal free resolution. The class of lattice-linear ideals includes (among others) the class of monomial ideals…
Every normal toric ideal of codimension two is minimally generated by a Grobner basis with squarefree initial monomials. A polynomial time algorithm is presented for checking whether a toric ideal of fixed codimension is normal.
Given multigraded free resolutions of two monomial ideals we construct a multigraded free resolution of the sum of the two ideals.