English
Related papers

Related papers: Binomial edge ideals with pure resolutions

200 papers

Let $G$ be a graph on the vertex set $[n]$ and $J_G$ the associated binomial edge ideal in the polynomial ring $S=\mathbb{K}[x_1,\ldots,x_n,y_1,\ldots,y_n]$. In this paper we investigate the depth of binomial edge ideals. More precisely, we…

Commutative Algebra · Mathematics 2021-08-13 Mohammad Rouzbahani Malayeri , Sara Saeedi Madani , Dariush Kiani

We obtain an improved lower bound for the regularity of the binomial edge ideals of trees. We prove an upper bound for the regularity of the binomial edge ideals of certain subclass of block-graphs. As a consequence we obtain sharp upper…

Commutative Algebra · Mathematics 2018-04-30 A. V. Jayanthan , N. Narayanan , B. V. Raghavendra Rao

Edge ideals of finite simple graphs are well-studied over polynomial rings. In this paper, we initiate the study of edge ideals over exterior algebras, specifically focusing on the depth and singular varieties of such ideals. We prove an…

Commutative Algebra · Mathematics 2022-08-09 Matthew Mastroeni , Jason McCullough , Andrew Osborne , Joshua Rice , Cole Willis

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…

Commutative Algebra · Mathematics 2026-01-22 Adam LaClair , Matthew Mastroeni , Jason McCullough , Irena Peeva

We study minimal free resolutions of edge ideals of bipartite graphs. We associate a directed graph to a bipartite graph whose edge ideal is unmixed, and give expressions for the regularity and the depth of the edge ideal in terms of…

Commutative Algebra · Mathematics 2012-12-04 Manoj Kummini

We associate to every graph a linear program for packings of vertex disjoint paths. We show that the optimal primal and dual values of the corresponding integer program are the binomial grade and height of the binomial edge ideal of the…

Commutative Algebra · Mathematics 2023-06-21 Adam LaClair

We introduce and study the concept which we call the splitting of a graph and compare algebraic properties of the edge ideals of graphs and those of their splitting graphs.

Commutative Algebra · Mathematics 2019-08-27 Jürgen Herzog , Somayeh Moradi , Masoomeh Rahimbeigi

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

Commutative Algebra · Mathematics 2024-07-24 Thanh Vu , Guangjun Zhu

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…

Combinatorics · Mathematics 2015-09-11 Carsten Conradi , Thomas Kahle

The cut sets of a graph are special sets of vertices whose removal disconnects the graph. They are fundamental in the study of binomial edge ideals, since they encode their minimal primary decomposition. We introduce the class of accessible…

Commutative Algebra · Mathematics 2022-01-04 Davide Bolognini , Antonio Macchia , Francesco Strazzanti

Let $G$ be a finite simple graph on $n$ non-isolated vertices, and let $J_G$ be its binomial edge ideal. We determine almost all pairs $(\text{projdim}(J_G),\text{reg}(J_G))$, where $G$ ranges over all finite simple graphs on $n$…

Commutative Algebra · Mathematics 2025-01-15 Antonino Ficarra , Emanuele Sgroi

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

Commutative Algebra · Mathematics 2021-02-23 René González-Martínez

We identify several classes of monomial ideals that possess minimal generalized Barile-Macchia resolutions. These classes of ideals include generic monomial ideals, monomial ideals with linear quotients, and edge ideals of hypertrees. We…

Commutative Algebra · Mathematics 2026-05-11 Trung Chau , Huy Tai Ha , Aryaman Maithani

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…

Commutative Algebra · Mathematics 2015-06-04 Dariush Kiani , Sara Saeedi Madani

We study powers of binomial edge ideals associated with closed and block graphs.

Commutative Algebra · Mathematics 2021-07-01 Viviana Ene , Giancarlo Rinaldo , Naoki Terai

We prove two recent conjectures on some upper bounds for the Castelnuovo-Mumford regularity of the binomial edge ideals of some different classes of graphs. We prove the conjecture of Matsuda and Murai for graphs which has a cut edge or a…

Commutative Algebra · Mathematics 2013-11-19 Dariush Kiani , Sara Saeedi Madani

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

Commutative Algebra · Mathematics 2017-09-25 Faryal Chaudhry , Rida Irfan

In this article, we explore the class of graphs for which the projective dimension of the quotient of the binomial edge ideals matches the big height of that ideal. Additionally, we investigate the Vasconcelos number of binomial edge ideals…

Commutative Algebra · Mathematics 2025-08-19 Arvind Kumar , Joshua Pomeroy , Le Tran

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…

Commutative Algebra · Mathematics 2017-05-09 Davide Bolognini , Antonio Macchia , Francesco Strazzanti

An ideal $I$ of a commutative ring $R$ is said to be of linear type when its Rees algebra and symmetric algebra exhibit isomorphism. In this paper, we investigate the conjecture put forth by Jayanthan, Kumar, and Sarkar (2021) that if $G$…

Commutative Algebra · Mathematics 2025-05-06 Marie Amalore Nambi , Neeraj Kumar