Related papers: Splittings of monomial ideals
Let I(G) be the edge ideal associated to a simple graph G. We study the graded Betti numbers that appear in the linear strand of the minimal free resolution of I(G).
We determine all possible triples of depth, dimension, and regularity of edge ideals of weighted oriented graphs with a fixed number of vertices. Also, we compute all the possible Betti table sizes of edge ideals of weighted oriented trees…
We study the binomial and monomial ideals arising from linear equivalence of divisors on graphs from the point of view of Gr\"obner theory. We give an explicit description of a minimal Gr\"obner bases for each higher syzygy module. In each…
We study unmixed and Cohen-Macaulay properties of the binomial edge ideal of some classes of graphs. We compute the depth of the binomial edge ideal of a generalized block graph. We also characterize all generalized block graphs whose…
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 investigate the analytic spread of binomial edge ideals of finite simple graphs. We provide tight bounds for this invariant in general. For special families of graphs (e.g., closed graphs, pseudo-forests), we compute the exact value for…
Let I=I(D) be the edge ideal of a weighted oriented graph D. We determine the irredundant irreducible decomposition of I. Also, we characterize the associated primes and the unmixed property of I. Furthermore, we give a combinatorial…
We consider path ideals associated to special classes of posets such as tree posets and cycles. We express their property of being sequentially Cohen-Macaulay in terms of the underlying poset. Moreover, monomial ideals, which arise from the…
We introduce a new class of monomial ideals which we call symmetric shifted ideals. Symmetric shifted ideals are fixed by the natural action of the symmetric group and, within the class of monomial ideals fixed by this action, they can be…
Cut ideals, introduced by Sturmfels and Sullivant, are used in phylogenetics and algebraic statistics. We study the minimal free resolutions of cut ideals of tree graphs. By employing basic methods from topological combinatorics, we obtain…
We determine (multi)graded Betti numbers of path ideals of lines and star graphs.
In this article bipartite planar graphs St_r are investigated, r the number of their plane regions. Bounds for the graded Betti numbers and the projective dimension of the quotient ring associated to such graphs are discussed. We prove that…
Let $I_\mathbb{X}$ be the bihomogeneous ideal of a finite set of points $\mathbb{X} \subseteq \mathbb{P}^1 \times \mathbb{P}^1$. The purpose of this note is to consider ``splittings'' of the ideal $I_\mathbb{X}$, that is, finding ideals $J$…
Let $S=K[x_1,\dots,x_n]$ be a polynomial ring in $n$ variables with coefficients over a field $K$. A $t$-spread lexsegment ideal $I$ of $S$ is a monomial ideal generated by a $t$-spread lexsegment set. We determine all $t$-spread lexsegment…
We classify the bipartite graphs $G$ whose binomial edge ideal $J_G$ is Cohen-Macaulay. The connected components of such graphs can be obtained by gluing a finite number of basic blocks with two operations. In this context we prove the…
We study weighted graphs and their "edge ideals" which are ideals in polynomial rings that are defined in terms of the graphs. We provide combinatorial descriptions of m-irreducible decompositions for the edge ideal of a weighted graph in…
We produce a family of complexes called trimming complexes and explore applications. We study how trimming complexes can be used to deduce the Betti table for the minimal free resolution of the ideal generated by subsets of a generating set…
In the present paper we prove that all homogeneous ideals with linear quotients are componentwise linear. Moreover we establish an extended version of Eliahou-Kervaire formula for graded Betti numbers.
We compute the multigraded Betti numbers of edge ideals for weighted oriented crown graphs using a novel approach. This approach, which we still call the \emph{induced subgraph approach}, originates from our prior work on computing Betti…
The vertex cover ideal $J(G)$ of a finite graph $G$ is studied. We characterize when a Cohen--Macaulay vertex cover ideal $J(G)$ has a Scarf minimal free resolution. Furthermore, by using both combinatorial and topological techniques, the…