Related papers: Regularity and h-polynomials of binomial edge idea…

Closed graphs have been characterized by Herzog et al. as the graphs whose binomial edge ideals have a quadratic Gr\"obner basis with respect to a diagonal term order. In this paper, we focus on a generalization of closed graphs, namely…

We describe the simplicial complex $\Delta$ such that the initial ideal of $J_G$ is the Stanley-Reisner ideal of $\Delta$. By $\Delta$ we show that if $J_G$ is $(S_2)$ then $G$ is accessible. We also characterize all accessible blocks with…

Let $G$ be a simple graph on $n$ vertices. We introduce the notion of bipartite connectivity of $G$, denoted by $\operatorname{bc}(G)$ and prove that $$\lim_{s \to \infty} \operatorname{depth} (S/I(G)^{(s)}) \le \operatorname{bc}(G),$$…

Let $S$ be the polynomial ring over a field $K$ and $I \subset S$ a homogeneous ideal. Let $h(S/I,\lambda)$ be the $h$-polynomial of $S/I$ and $s = \mathrm{deg} h(S/I,\lambda)$ the degree of $h(S/I,\lambda)$. It follows that the inequality…

In this paper we give upper bounds for the regularity of edge ideal of some classes of graphs in terms of invariants of graph. We introduce two numbers $a'(G)$ and $n(G)$ depending on graph $G$ and show that for a vertex decomposable graph…

We give a complete characterization of graphs whose binomial edge ideal is licci. An important tool is a new general upper bound for the regularity of binomial edge ideals.

Let $I(G)$ be the edge ideal of a bicyclic graph. In this paper, we characterize the Castelnuovo-Mumford regularity of $I(G)$ in terms of the induced matching number of $G$. For the base case of this family of graphs, i.e. dumbbell graph,…

Let C(X) be the algebra generated by the curvature 2-forms of the standard hermitian line bundles over the complex homogeneous manifold X=G/B. We calculate the Hilbert polynomial of C(X) and give its presentation as a quotient of a…

This note aims at finding explicit and efficient generation of ideals in subalgebras $R$ of the polynomial ring $S=k[t]$ ($k$ a field) such that $t^{c_0}S \subseteq R$ for some integer $c_0 > 0$. The class of these subalgebras which we call…

A graph $G$ is $k$-edge-Hamiltonian if any collection of vertex-disjoint paths with at most $k$ edges altogether belong to a Hamiltonian cycle in $G$. A graph $G$ is $k$-Hamiltonian if for all $S\subseteq V(G)$ with $|S|\le k$, the subgraph…

We investigate products J of ideals of "row initial" minors in the polynomial ring K[X] defined by a generic m-by-n matrix. Such ideals are shown to be generated by a certain set of standard bitableaux that we call superstandard. These…

We investigate, using the notion of linear quotients, significative classes of connected graphs whose monomial edge ideals, not necessarily squarefree, have linear resolution, in order to compute standard algebraic invariants of the…

In this article, we give a comprehensive survey of the recent progress of research on binomial edge ideal of a graph since 2018.

Let S be a polynomial algebra over a field. If I is the edge ideal of a perfect semiregular tree, then we give precise formulas for values of depth, Stanley depth, projective dimension, regularity and Krull dimension of S/I.

Let $A = K[x_1, ..., x_n]$ denote the polynomial ring in $n$ variables over a field $K$ with each $\deg x_i = 1$. Let $I$ be a homogeneous ideal of $A$ with $I \ne A$ and $H_{A/I}$ the Hilbert function of the quotient algebra $A / I$. Given…

In this paper, we investigate the arithmetical rank of a binomial ideal $J$. We provide lower bounds for the binomial arithmetical rank and the $J$-complete arithmetical rank of $J$. Special attention is paid to the case where $J$ is the…

Let G be a finite simple graph. In this paper we will show that the binomial edge ideal of G, JG is toric if and only if each connected component of G is complete and in this case it is the sum of toric ideal associated to bipartite…

Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal. In this paper, we obtain upper bounds for the Castelnuovo-Mumford regularity of $I(G)^q$ in terms of certain combinatorial invariants associated with $G$. We…

Let H = <n_1,...,n_e> be a numerical semigroup generated by e elements. Let k[H]= k[x_1, .... , x_e]/I_H = S/I_H be the semigroup ring of H over k. We define inverse polynomial J_{H,h} for h in H and express the defining ideal of I_H using…

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…