Related papers: Sequentially Cohen-Macaulay binomial edge ideals
We study the regularity of binomial edge ideals. For a closed graph $G$ we show that the regularity of the binomial edge ideal $J_G$ coincides with the regularity of $\ini_{\lex}(J_G)$ and can be expressed in terms of the combinatorial data…
We provide algorithmic methods to check the Cohen--Macaulayness, Buchsbaumness and/or Gorensteiness of some families of semigroup rings that are constructed from the dilation of bounded convex polyhedrons of $\R^3_{\geq}$. Some families of…
In this paper, we give a new criterion for the Cohen-Macaulayness of vertex splittable ideals, a family of monomial ideals recently introduced by Moradi and Khosh-Ahang. Our result relies on a Betti splitting of the ideal and provides an…
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 introduce the concept of complementary edge ideals of graphs and study their algebraic properties and invariants.
In this short note we prove that the projective dimension of a sequentially Cohen-Macaulay square-free monomial ideal is equal to the maximal height of its minimal primes (also known as the big height), or equivalently, the maximal…
In this paper we study irreducible representations and symbolic Rees algebras of monomial ideals. Then we examine edge ideals associated to vertex-weighted oriented graphs. These are digraphs having no oriented cycles of length two with…
We extend the definition of chordal from graphs to clutters. The resulting family generalizes both chordal graphs and matroids, and obeys many of the same algebraic and geometric properties. Specifically, the independence complex of a…
As the binomial edge ideal of a graph is always generated by homogeneous quadratic polynomials corresponding to the edges of the graph, the question of when a binomial edge ideal defines a Koszul algebra has been studied by many authors…
Using techniques coming from the theory of marked bases, we develop new computational methods for detection and construction of Cohen-Macaulay, Gorenstein and complete intersection homogeneous polynomial ideals. Thanks to the functorial…
We classify generalized block graphs whose binomial edge ideals admit a unique extremal Betti number. We prove that the Castelnuovo-Mumford regularity of binomial edge ideals of generalized block graphs is bounded below by $m(G)+1$, where…
The associated primes of an arbitrary lexsegment ideal $I\subset S=K[x_1,...,x_n]$ are determined. As application it is shown that $S/I$ is a pretty clean module, therefore, $S/I$ is sequentially Cohen-Macaulay and satisfies Stanley's…
In this article we study the structure of residual intersections via constructing a finite complex which is acyclic under some sliding depth conditions on the cycles of the Koszul complex. This complex provides information on an ideal which…
We prove that sequentially Cohen-Macaulay rings in positive characteristic, as well as sequentially Cohen-Macaulay Stanley-Reisner rings in any characteristic, have trivial Lyubeznik table. Some other configurations of Lyubeznik tables are…
We study rings of integral modular forms for congruence subgroups as modules over the ring of integral modular forms for the full modular group. In many cases these modules are free or decompose at least into well-understood pieces. We…
In this article, we characterize Cohen-Macaulay permutation graphs. In particular, we show that a permutation graph is Cohen-Macaulay if and only if it is well-covered and there exists a unique way of partitioning its vertex set into $r$…
A cut ideal of a graph records the relations among the cuts of the graph. These toric ideals have been introduced by Sturmfels and Sullivant who also posed the problem of relating their properties to the combinatorial structure of the…
In this paper we prove the conjectured upper bound for Castelnuovo-Mumford regularity of binomial edge ideals posed in [23], in the case of chordal graphs. Indeed, we show that the regularity of any chordal graph G is bounded above by the…
We present novel graph kernels for graphs with node and edge labels that have ordered neighborhoods, i.e. when neighbor nodes follow an order. Graphs with ordered neighborhoods are a natural data representation for evolving graphs where…
We study the Cohen-Macaulay property of triangular graphs $T_n$. We show that $T_2$, $T_3$ and $T_5$ are Cohen-Macaulay graphs, and that $T_4$, $T_6$, $T_8$ and $T_n$ are not Cohen-Macaulay graphs, for $n\geq 10$. Finally, we prove that…