Related papers: On a regularity-conjecture of generalized binomial…

We give a lower bound for the Castelnuovo-Mumford regularity of binomial edge ideals of block graphs by computing the two distinguished extremal Betti numbers of a new family of block graphs, called flower graphs. Moreover, we present a…

For a finite simple graph $G$ we give an upper bound for the regularity of the powers of the edge ideal $I(G)$.

Let $J_G$ denote the binomial edge ideal of a connected undirected graph on $n$ vertices. This is the ideal generated by the binomials $x_iy_j - x_jy_i, 1\leq i < j \leq n,$ in the polynomial ring $S= K[x_1,...,x_n,y_1,...,y_n]$ where…

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…

In this work, some combinatorial lower bound for regularity of powers of the edge ideal of a uniform hypergarph is gained. A family of hypergraphs whose regularity of edge ideal attains this bound and has a significant difference from the…

This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…

We show that the universal Gr\"obner basis and the Graver basis of a binomial edge ideal coincide. We provide a description for this basis set in terms of certain paths in the underlying graph. We conjecture a similar result for a parity…

In this article, we study the powers of the generalized binomial edge ideal $\mathcal{J}_{K_m,P_n}$ of a path graph $P_n$. We explicitly compute their regularities and determine the limit of their depths. We also show that these ordinary…

Binomial edge ideals associated to a simple graph G were introduced by Herzog and collaborators and, independently, by Ohtani. They became an ``instant classic" in combinatorial commutative algebra with more than 100 papers devoted to their…

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…

This work establishes combinatorial bounds on the Castelnuovo-Mumford regularity of edge ideals for trees and their multi-whiskered variants. For a tree \( T \), we give bounds for the Castelnuovo-Mumford regularity of \( I(T) \) in terms…

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$.…

We prove several cases of the Betti number conjecture for the binomial edge ideal $J_G$ of a proper interval graph $G$ (also known as closed graph). Namely, we show that this conjecture is true for the linear strand of $J_G$, and true in…

Let $X \subseteq \mathbb{P}^r$ be a non-degenerate smooth projective variety of dimension $n$, codimension $e$, and degree $d$ defined over an algebraically closed field of characteristic zero. In this paper, we first show that $\text{reg}…

Motivated by questions in interpolation theory and on linear systems of rational varieties, one is interested in upper bounds for the Castelnuovo-Mumford regularity of arbitrary subschemes of fat points. An optimal upper bound, named after…

In this paper we give new upper bounds on the regularity of edge ideals whose resolutions are k-steps linear; surprisingly, the bounds are logarithmic in the number of variables. We also give various bounds for the projective dimension of…

We improve certain degree bounds for Grobner bases of polynomial ideals in generic position. We work exclusively in deterministically verifiable and achievable generic positions of a combinatorial nature, namely either strongly stable…

Some recent investigations indicate that for the classification of Cohen-Macaulay binomial edge ideals, it suffices to consider biconnected graphs with some whiskers attached (in short, `block with whiskers'). This paper provides explicit…

For all integers $4 \leq r \leq d$, we show that there exists a finite simple graph $G= G_{r,d}$ with toric ideal $I_G \subset R$ such that $R/I_G$ has (Castelnuovo-Mumford) regularity $r$ and $h$-polynomial of degree $d$. To achieve this…

The purpose of this paper is to establish a Castelnuovo-Mumford regularity bound for threefolds with mild singularities. Let $X$ be a non-degenerate normal projective threefold in $\mathbb{P}^r$ of degree $d$ and codimension $e$. We prove…