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

An explicit lattice point realization is provided for the primary components of an arbitrary binomial ideal in characteristic zero. This decomposition is derived from a characteristic-free combinatorial description of certain primary…

In this paper, we provide a combinatorial characterization of those collections of cells whose inner $2$-minor ideals are complete intersections. More precisely, given a collection of cells $\mathcal C$ and its associated inner $2$-minor…

For a simple graph $G$, let $J_G$ denote the corresponding binomial edge ideal. This article considers the binomial edge ideal of the corona product of two connected graphs $G$ and $H$. The corona product of $G$ and $H$, denoted by $G\circ…

We compute one of the distinguished extremal Betti number of the binomial edge ideal of a block graph, and classify all block graphs admitting precisely one extremal Betti number.

In this paper, we investigate the degree of $h$-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the $h$-polynomial for various fundamental classes of graphs such as…

Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity…

Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…

Herzog, Hibi, and Zheng classified the Cohen-Macaulay edge ideals of chordal graphs. In this paper, we classify Cohen-Macaulay edge ideals of (vertex) weighted oriented chordal and simplicial graphs, a more general class of monomial ideals.…

Let $R=K[x_1,...,x_n]$ be the polynomial ring in $n$ variables over a field $K$ and let $J$ be a matroidal ideal of degree $d$ in $R$. In this paper, we study the class of sequentially Cohen-Macaulay matroidal ideals. In particular, all…

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 the edge ideal of a Cohen-Macaulay tree of dimension $d$ over a polynomial ring $S = \mathrm{k}[x_1,\ldots,x_{d},y_1,\ldots,y_d]$. We prove that for all $t \ge 1$, $$\operatorname{depth} (S/I^t) = \operatorname{max} \{d -t + 1, 1…

The third named author and P\'{e}rez proved that under certain conditions the test ideal of a module closure agrees with the trace ideal of the module closure. We use this fact to compute the test ideals of various rings with respect to the…

Our focus in this paper is in effective computation of the core core(I) of an ideal I which is defined to be the intersection of all minimal reductions of I. The first main result is a closed formula for the graded core(m) of the maximal…

We consider complete intersection ideals in a polynomial ring over a field of characteristic zero that are stable under the action of the symmetric group permuting the variables. We determine the possible representation types for these…

We prove the multiplicity bounds conjectured by Herzog-Huneke-Srinivasan and Herzog-Srinivasan in the following cases: the strong conjecture for edge ideals of bipartite graphs, and the weaker Taylor bound conjecture for all quadratic…

In this paper, we prove that a squarefree monomial ideal of height 2 whose quotient ring is Cohen-Macaulay is set-theoretic complete intersection.

We compute the depth and (give bounds for) the regularity of generalized binomial edge ideals associated with generalized block graphs.

We study the class of squarefree principal vector-spread Borel ideals. We compute the minimal primary decomposition of these ideals and thereby we prove that they are sequentially Cohen-Macaulay. As the final conclusion of our results, we…

We provide formulas and algorithms for computing the excess numbers of certain ideals. The solution for monomial ideals is given by the mixed volumes of certain polytopes. These results enable us to design specific homotopies for numerical…

Let $G$ be a finite graph and $I(G)$ its edge ideal. We give a full description of the Stanley--Reisner complex of the polarization of $I(G)^2$, naturally introducing the tools of Stanley--Reisner theory in the study of the algebraic…