中文
相关论文

相关论文: Extremal Betti numbers of some Cohen-Macaulay bino…

200 篇论文

We study the depth of classes of binomial edge ideals and classify all closed graphs whose binomial edge ideal is Cohen--Macaulay.

交换代数 · 数学 2011-07-08 Viviana Ene , Juergen Herzog , Takayuki Hibi

We classify the Cohen-Macaulay binomial edge ideals of cactus and bicyclic graphs.

交换代数 · 数学 2017-12-19 Giancarlo Rinaldo

In this paper we provide a full combinatorial characterization of sequentially Cohen-Macaulay binomial edge ideals of closed graphs. In addition, we show that a binomial edge ideal of a closed graph is approximately Cohen-Macaulay if and…

交换代数 · 数学 2022-07-12 Viviana Ene , Giancarlo Rinaldo , Naoki Terai

We classify all binomial edge ideals that are complete intersection and Cohen-Macaulay almost complete intersection. We also describe an algorithm and provide an implementation to compute primary decomposition of binomial edge ideals.

交换代数 · 数学 2012-09-28 Giancarlo Rinaldo

Binomial edge ideals IG of a graph G were introduced by [4]. They found some classes of graphs G with the property that IG is a Cohen-Macaulay ideal. This might happen only for few classes of graphs. A certain generalization of being…

交换代数 · 数学 2013-01-07 Sohail Zafar

Let $G$ be a simple graph on the vertex set $[n]$ and $J_G$ be the corresponding binomial edge ideal. Let $G=v*H$ be the cone of $v$ on $H$. In this article, we compute all the Betti numbers of $J_G$ in terms of Betti number of $J_H$ and as…

交换代数 · 数学 2019-10-07 Arvind Kumar , Rajib Sarkar

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…

交换代数 · 数学 2015-06-04 Dariush Kiani , Sara Saeedi Madani

Connected bipartite graphs whose binomial edge ideals are Cohen--Macaulay have been classified by Bolognini et al. In this paper, we compute the depth, Castelnuovo--Mumford regularity, and dimension of the generalized binomial edge ideals…

交换代数 · 数学 2023-05-10 Yi-Huang Shen , Guangjun Zhu

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.

交换代数 · 数学 2018-02-19 Juergen Herzog , Giancarlo Rinaldo

We discuss algebraic and homological properties of binomial edge ideals associated to graphs which are obtained by gluing of subgraphs and the formation of cones.

交换代数 · 数学 2012-05-03 Asia Rauf , Giancarlo Rinaldo

We prove that wheels and block graphs have sequentially Cohen-Macaulay binomial edge ideals. Moreover, we provide a construction of new families of sequentially Cohen-Macaulay graphs by cones.

交换代数 · 数学 2025-07-08 Ernesto Lax , Giancarlo Rinaldo , Francesco Romeo

We study the Betti numbers of binomial edge ideal associated to some classes of graphs with large Castelnuovo-Mumford regularity. As an application we give several lower bounds of the Castelnuovo-Mumford regularity of arbitrary graphs…

交换代数 · 数学 2013-10-16 Zohaib Zahid , Sohail Zafar

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…

交换代数 · 数学 2022-01-04 Davide Bolognini , Antonio Macchia , Francesco Strazzanti

In this paper, we obtain a combinatorial formula for computing the Betti numbers in the linear strand of edge ideals of bipartite Kneser graphs. We deduce lower and upper bounds for regularity of powers of edge ideals of these graphs in…

交换代数 · 数学 2021-05-14 Ajay Kumar , Pavinder Singh , Rohit Verma

Let $G$ be a simple graph on $n$ vertices and let $J_{G,m}$ be the generalized binomial edge ideal associated to $G$ in the polynomial ring $K[x_{ij}, 1\le i \le m, 1\le j \le n]$. We classify the Cohen-Macaulay generalized binomial edge…

交换代数 · 数学 2023-07-04 Luca Amata , Marilena Crupi , Giancarlo Rinaldo

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…

交换代数 · 数学 2017-05-09 Davide Bolognini , Antonio Macchia , Francesco Strazzanti

Let $G$ be a cycle or a complete bipartite graph. We show that the binomial edge ideal $J_{G}$ and its initial ideal with respect to the lexicographic order have the same extremal Betti number.

交换代数 · 数学 2013-10-11 Ahmet Dokuyucu

Let $G$ be a finite simple graph on $n$ vertices and $J_G$ denote the corresponding binomial edge ideal in $S = K[x_1, \ldots, x_n, y_1, \ldots, y_n].$ In this article, we prove that if $G$ is a fan graph of a complete graph, then…

交换代数 · 数学 2019-03-14 A. V. Jayanthan , Arvind Kumar

We introduce a class of ideals generated by a set of 2-minors of $m\times n$-matrix of indeterminates indexed by a pair of graphs. This class of ideals is a natural common generalization of binomial edge ideals and ideals generated by…

交换代数 · 数学 2015-01-14 Viviana Ene , Jürgen Herzog , Takayuki Hibi , Ayesha Asloob Qureshi

We provide some new conditions under which the graded Betti numbers of a monomial ideal can be computed in terms of the graded Betti numbers of smaller ideals, thus complementing Eliahou and Kervaire's splitting approach. As applications,…

交换代数 · 数学 2009-02-14 Christopher A. Francisco , Huy Tai Ha , Adam Van Tuyl
‹ 上一页 1 2 3 10 下一页 ›