Related papers: Cohen-Macaulay binomial edge ideals of small devia…

Let $G$ be a simple graph with binomial edge ideal $J_G$. We prove how to calculate the multidegree of $J_G$ based on combinatorial properties of $G$. In particular, we study the set $S_{\min}(G)$ defined as the collection of subsets of…

While every grade 2 perfect ideal in a regular local ring is linked to a complete intersection ideal, it is known not to be the case for ideals of grade 3. We soften the blow by proving that every grade 3 perfect ideal in a regular local…

We introduce differential primary decompositions for ideals in a commutative ring. Ideal membership is characterized by differential conditions. The minimal number of conditions needed is the arithmetic multiplicity. Minimal differential…

The study of the edge ideal $I(D_{G})$ of a weighted oriented graph $D_{G}$ with underlying graph $G$ started in the context of Reed-Muller type codes. We generalize a Cohen-Macaulay construction for $I(D_{G})$, which Villarreal gave for…

We classify connected graphs $G$ whose binomial edge ideal is Gorenstein. The proof uses methods in prime characteristic.

For the edge ideal $I(\D)$ of a weighted oriented graph $\D$, we prove that its symbolic powers $I(\D)^{(t)}$ are Cohen-Macaulay for all $t\geqslant 1$ if and only if the underlying graph $G$ is composed of a disjoint union of some complete…

In this paper, we study a family of binomial ideals defining monomial curves in the $n-$dimensional affine space determined by $n$ hypersurfaces of the form $x_i^{c_i} - x_1^{u_{i1}} \cdots x_n^{u_{1n}} \in k[x_1, \ldots, x_n]$ with $u_{ii}…

In this paper we describe the method which we applied to successfully compute the primary decomposition of a certain ideal coming from applications in combinatorial algebra and algebraic statistics regarding conditional independence…

Let A be a Cohen-Macaulay local ring of dimension d and I an ideal in A. Let M be a finitely generated maximal Cohen-Macaulay A-module. Let I be a locally complete intersection ideal of analytic deviation one and reduction number at most…

Inspired by the notion of K\"onig graphs we introduce graded ideals of K\"onig type with respect to a monomial order $<$. It is shown that if $I$ is of K\"onig type, then the Cohen--Macaulay property of $\ini_<(I)$ does not depend on the…

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…

Given a 0-dimensional affine K-algebra R=K[x_1,...,x_n]/I, where I is an ideal in a polynomial ring K[x_1,...,x_n] over a field K, or, equivalently, given a 0-dimensional affine scheme, we construct effective algorithms for checking whether…

We prove that the $d$-component of the generic initial ideal, with respect to the reverse lexicographic order, of an ideal generated by a regular sequence of homogeneous polynomials of degree $d$ is revlex in a particular, but important,…

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…

Let $G$ be a finite simple graph on the vertex set $[n] = \{ 1, \ldots, n \}$ and $K[X, Y] = K[x_1, \ldots, x_n, y_1, \ldots, y_n]$ the polynomial ring in $2n$ variables over a field $K$ with each $\mathrm{deg} x_i = \mathrm{deg} y_j = 1$.…

A central question in liaison theory asks whether every Cohen-Macaulay, graded ideal of a standard graded K-algebra belongs to the same G-liaison class of a complete intersection. In this paper we answer this question positively for toric…

We classify all normal edge ideals of edge-weighted graphs.

We describe an algorithm which finds binomials in a given ideal $I\subset\mathbb{Q}[x_1,\dots,x_n]$ and in particular decides whether binomials exist in $I$ at all. Binomials in polynomial ideals can be well hidden. For example, the lowest…

A numerical characterization is given of the so-called h-triangles of sequentially Cohen-Macaulay simplicial complexes. This result characterizes the number of faces of various dimensions and codimensions in such a complex, generalizing the…

Let $G$ be a simple graph on $n$ vertices. Let $L_G \text{ and } \mathcal{I}_G \: $ denote the Lov\'asz-Saks-Schrijver(LSS) ideal and parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots,…